On Minimal Strings Containing the Elements of S_n by Decimation
Robert Erra, Nik Lygerōs, Nigel Stewart · Discrete Mathematics & Theoretical Computer Science · 2001
The permutations by decimation problem is thought to be applicable to computer graphics, and raises interesting theoretical questions in combinatory theory.We present the results of some theoretical and practical investigation into this problem.We show that sequences of this form are $O(n^2)$ in length, but finding optimal solutions can be difficult.