On Minimal Strings Containing the Elements of S_n by Decimation
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 len...
Main Authors: | Robert Erra, Nik Lygeros, Nigel Stewart |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2289/pdf |
Similar Items
-
Pseudo-Permutations II: Geometry and Representation Theory
by: François Boulier, et al.
Published: (2001-01-01) -
Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles
by: Gilles Radenne
Published: (2001-01-01) -
The Many Faces of Alternating-Sign Matrices
by: James Propp
Published: (2001-01-01) -
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Tiling the Line with Triples
by: Aaron Meyerowitz
Published: (2001-01-01)