On Minimal Strings Containing the Elements of S_n by Decimation

Abstract : 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.
Type de document :
Communication dans un congrès
Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.165-176, 2001, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01182969
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 6 août 2015 - 11:26:57
Dernière modification le : jeudi 29 mars 2018 - 14:14:02
Document(s) archivé(s) le : mercredi 26 avril 2017 - 09:46:06

Fichier

dmAA0112.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01182969, version 1

Collections

Citation

Robert Erra, Nik Lygeros, Nigel Stewart. On Minimal Strings Containing the Elements of S_n by Decimation. Cori, Robert and Mazoyer, Jacques and Morvan, Michel and Mosseri, Rémy. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), pp.165-176, 2001, DMTCS Proceedings. 〈hal-01182969〉

Partager

Métriques

Consultations de la notice

81

Téléchargements de fichiers

159