A universal cycle for strings with fixed-content (which are also known as multiset permutations)

DOI10.1007/978-3-030-83508-8_43MaRDI QIDQ832908zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_43

zbMATH Keywords

cool-lexde Bruijn cyclefixed-contentgray codemultiset permutationnecklaceParikh vectoruniversal cycle

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• A fast algorithm to generate necklaces with fixed content
• A framework for constructing de Bruijn sequences via simple successor rules
• A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
• An algorithm for generating necklaces of beads in two colors
• An explicit universal cycle for the (n-1)-permutations of an n-set
• Binary bubble languages and cool-lex order
• De Bruijn sequences for fixed-weight binary strings
• De Bruijn sequences for the binary strings with maximum density
• Efficient universal cycle constructions for weak orders
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• Graph universal cycles of combinatorial objects
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• Lexicographically least circular substrings
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Research problems on Gray codes and universal cycles
• Shorthand universal cycles for permutations
• Symmetry types of periodic sequences
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Universal cycles for combinatorial structures
• Universal cycles for permutations
• Universal cycles for weak orders
• Universal Cycles for Weight-Range Binary Strings
• Universal cycles of classes of restricted words

Cited in

(5)

• Enumerations of universal cycles for \(k\)-permutations
• Flip-swap languages in binary reflected Gray code order
• Universal Cycles for Weight-Range Binary Strings
• Constructing the first (and coolest) fixed-content universal cycle
• An effective approach to enumerate universal cycles for k-permutations

This page was built for publication: A universal cycle for strings with fixed-content (which are also known as multiset permutations)

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