Geodesic
A construction of short sequences containing all permutations of a set as subsequences
Sasa Radomirovic1
1ETH Zurich
The electronic journal of combinatorics, Tome 19 (2012) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A sequence over a fixed finite set is said to be complete if it contains all permutations of the set as subsequences. Determining the length of shortest complete sequences is an open problem. We improve the existing upper bound and introduce tools to manually prove the completeness of sequences.
DOI : 10.37236/2859
Classification : 68R15, 05A05
Mots-clés : combinatorics on words, shortest sequences, permutations

Sasa Radomirovic  1

1 ETH Zurich 
@article{10_37236_2859,
     author = {Sasa Radomirovic},
     title = {A construction of short sequences containing all permutations of a set as subsequences},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {4},
     doi = {10.37236/2859},
     zbl = {1266.68152},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2859/}
}
TY  - JOUR
AU  - Sasa Radomirovic
TI  - A construction of short sequences containing all permutations of a set as subsequences
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2859/
DO  - 10.37236/2859
ID  - 10_37236_2859
ER  - 
%0 Journal Article
%A Sasa Radomirovic
%T A construction of short sequences containing all permutations of a set as subsequences
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/2859/
%R 10.37236/2859
%F 10_37236_2859
Sasa Radomirovic. A construction of short sequences containing all permutations of a set as subsequences. The electronic journal of combinatorics, Tome 19 (2012) no. 4. doi: 10.37236/2859

Cité par Sources :