Universal cycles for permutations

DOI10.1016/j.disc.2007.11.004zbMath1181.05005arXiv0710.5611OpenAlexW2100731258MaRDI QIDQ1044883

J. Robert Johnson

Publication date: 15 December 2009

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

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

zbMATH Keywords

permutationsuniversal cyclescombinatorial generation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (22)

A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Euler tours in hypergraphs ⋮ Supertrees ⋮ Enumerating cycles in the graph of overlapping permutations ⋮ Graph universal cycles: compression and connections to universal cycles ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ A new universal cycle for permutations ⋮ Unnamed Item ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Containing All Permutations ⋮ Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set ⋮ Shorthand universal cycles for permutations ⋮ Graph universal cycles of combinatorial objects ⋮ Generalized de Bruijn words for primitive words and powers ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ The feasible region for consecutive patterns of permutations is a cycle polytope ⋮ Gray codes and symmetric chains ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Shortened universal cycles for permutations

Cites Work

• Unnamed Item
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles for combinatorial structures
• Shorthand universal cycles for permutations

This page was built for publication: Universal cycles for permutations