On a conjecture of H. Gupta

DOI10.1016/j.disc.2011.12.027zbMath1238.05004arXiv1009.5106OpenAlexW2085096159WikidataQ122985332 ScholiaQ122985332MaRDI QIDQ408183

David Zmiaikou, Emmanuel Lecouturier

Publication date: 29 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.5106

zbMATH Keywords

generating permutationsRosary

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (3)

An asymptotically tight lower bound for superpatterns with small alphabets ⋮ Counting formulae for square-tiled surfaces in genus two ⋮ Containing All Permutations

Cites Work

• Short permutation strings
• A lower bound on the length of a sequence containing all permutations as subsequences
• On permutation-generating strings and rosaries
• Shortest string containing all permutations
• Shortest string containing all permutations
• Unsolved problems in number theory

This page was built for publication: On a conjecture of H. Gupta