Constructing the first (and coolest) fixed-content universal cycle

DOI10.1007/s00453-022-01047-2OpenAlexW4308275632MaRDI QIDQ6103527

Joe Sawada, Aaron Williams

Publication date: 5 June 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01047-2

zbMATH Keywords

de Bruijn sequencemultiset permutationcool-lex orderuniversal cycleshift gray codeParikh vectorfixed contentshorthand

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Properties of the cycles that contain all vectors of weight \(\le k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• Binary bubble languages and cool-lex order
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles of classes of restricted words
• Symmetry types of periodic sequences
• A universal cycle for strings with fixed-content (which are also known as multiset permutations)
• Universal cycles for permutations
• The coolest way to generate combinations
• Research problems on Gray codes and universal cycles
• An algorithm for generating necklaces of beads in two colors
• Lexicographically least circular substrings
• Universal cycles for combinatorial structures
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• A fast algorithm to generate necklaces with fixed content
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• A new universal cycle for permutations
• Shorthand universal cycles for permutations
• A framework for constructing de Bruijn sequences via simple successor rules
• Graph universal cycles of combinatorial objects
• On universal cycles of labeled graphs
• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• A Simple Proof of Rankin's Campanological Theorem
• The Greedy Gray Code Algorithm
• Universal Cycles for Weight-Range Binary Strings
• Universal Cycles for Weak Orders
• De Bruijn Sequences for Fixed-Weight Binary Strings
• Hamilton Cycles in Restricted and Incomplete Rotator Graphs
• Algorithms for the generation of full-length shift- register sequences
• An algorithm for constructing m-ary de Bruijn sequences
• Doubly adjacent gray codes for the symmetric group
• The stacker crane problem and the directed general routing problem
• A problem in arrangements
• Solving the Sigma-Tau Problem
• A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
• Shift Register Sequences
• On a Greedy Algorithm to Construct Universal Cycles for Permutations
• Syntactic view of sigma-tau generation of permutations

This page was built for publication: Constructing the first (and coolest) fixed-content universal cycle