On Minimal Strings Containing the Elements of S_n by Decimation
Erra, Robert ; Lygeros, Nik ; Stewart, Nigel
HAL, hal-01182969 / Harvested from HAL
Text on HAL
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.
Publié le : 2001-07-04
Classification:  Permutations,  q-analogs,  Hyperplane Arrangements,  Symmetric Group,  [INFO]Computer Science [cs],  [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG],  [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-01182969,
     author = {Erra, Robert and Lygeros, Nik and Stewart, Nigel},
     title = {On Minimal Strings Containing the Elements of S\_n by Decimation},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01182969}
}

Erra, Robert; Lygeros, Nik; Stewart, Nigel. On Minimal Strings Containing the Elements of S_n by Decimation. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-01182969/