On Minimal Strings Containing the Elements of S_n by Decimation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2001

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.
Fichier principal
Vignette du fichier
dmAA0112.pdf (107.11 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01182969 , version 1 (06-08-2015)

Identifiers

Cite

Robert Erra, Nik Lygeros, Nigel Stewart. On Minimal Strings Containing the Elements of S_n by Decimation. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.165-176, ⟨10.46298/dmtcs.2289⟩. ⟨hal-01182969⟩
70 View
674 Download

Altmetric

Share

Gmail Facebook X LinkedIn More