A new universal cycle for permutations

DOI10.1007/S00373-017-1778-3MaRDI QIDQ1696522zbMATH OpenOpenAlexFDO

Authors Dennis Wong

Publication date 14 February 2018

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-017-1778-3

zbMATH Keywords

de Bruijn sequencesGray codespermutationsuniversal cycles

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Eulerian and Hamiltonian graphs (05C45) Combinatorics in computer science (68R05)

Recommendations

• Faster generation of shorthand universal cycles for permutations
• Universal cycles for permutations
• Shorthand universal cycles for permutations
• Universal cycles for permutation classes
• Shortened universal cycles for permutations

Cites work

• An explicit universal cycle for the (n-1)-permutations of an n-set
• Faster generation of shorthand universal cycles for permutations
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• Shorthand universal cycles for permutations
• Universal cycles for combinatorial structures
• Universal cycles for permutations
• Universal cycles of k-subsets and k-permutations

Cited in

(13)

• Shorthand universal cycles for permutations
• A cycle lemma for permutation inversions
• Shortened universal cycles for permutations
• Enumerations of universal cycles for \(k\)-permutations
• scientific article; zbMATH DE number 1811347 (Why is no real title available?)
• Faster generation of shorthand universal cycles for permutations
• Efficient enumeration of cyclic permutations in situ
• On a greedy algorithm to construct universal cycles for permutations
• Constructing the first (and coolest) fixed-content universal cycle
• An explicit universal cycle for the (n-1)-permutations of an n-set
• An effective approach to enumerate universal cycles for k-permutations
• Efficient methods of constructing universal cycles for k-permutations
• Efficient universal cycle constructions for k-permutations via concatenation trees

This page was built for publication: A new universal cycle for permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696522)