DMTCS Proceedings, Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001

Font Size:  Small  Medium  Large

On Minimal Strings Containing the Elements of Sn by Decimation

Robert Erra, Nik Lygeros, Nigel Stewart


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(n2) in length, but finding optimal solutions can be difficult.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional