Shortened universal cycles for permutations

DOI10.1016/j.dam.2022.09.026zbMath1503.05004arXiv2204.02910OpenAlexW4307698268MaRDI QIDQ2097185

Elizabeth Sprangel, Clare Sibley, Bernard Lidický, Rachel Kirsch

Publication date: 11 November 2022

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

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

zbMATH Keywords

compressionpermutationuniversal cycles

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (1)

Graph universal cycles: compression and connections to universal cycles

Cites Work

• Unnamed Item
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• Universal partial words over non-binary alphabets
• A new universal cycle for permutations
• On shortening \(u\)-cycles and \(u\)-words for permutations
• Shorthand universal cycles for permutations
• Graph universal cycles of combinatorial objects
• On universal cycles of labeled graphs
• Universal Cycles for Weak Orders
• s-Overlap Cycles for Permutations
• On universal partial words
• A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
• On a Greedy Algorithm to Construct Universal Cycles for Permutations

This page was built for publication: Shortened universal cycles for permutations