3 papers
math.CO2026
Necklaces and Lyndon words in colexicographic order
Daniel Gabric, Joe Sawada
We present the first constant-amortized-time algorithms for generating all length- necklaces and Lyndon words over a -letter alphabet in colexicographic order, for arbitrary…
cs.DM2026
Universal cycle constructions for k-subsets and k-multisets
Colin Campbell, Luke Janik-Jones, Joe Sawada
A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S|that contains a representation of each element in S exactly once as a substring. If S is th…
cs.DM2026
Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
Daniel Gabric, Wazed Imam, Lukas Janik Jones +1
A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S| that contains a representative of each element in S exactly once as a substring. Despite t…