1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
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…
cs.DM2024
Constructing -ary Orientable Sequences with Asymptotically Optimal Length
Daniel GabriÄ, Joe Sawada
An orientable sequence of order over an alphabet is a cyclic sequence such that each length- substring appears at most once \emph{in either direction…