The existence and structure of universal partial cycles

DOI10.1007/S10623-026-01841-XMaRDI QIDQ7297764zbMATH OpenFDO

Authors Dylan Fillmore, Bennet Goeckner, Rachel Kirsch, Kirin Martin, Daniel McGinnis

Publication date 15 July 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-026-01841-X

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Cites work

• A class of nonlinear de Bruijn cycles
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Binary de Bruijn partial words with one hole
• De Bruijn Sequences and Perfect Factors
• Extending de Bruijn sequences to larger alphabets
• scientific article; zbMATH DE number 2238187 (Why is no real title available?)
• Investigating the discrepancy property of de Bruijn sequences
• Longest subsequences shared by two de Bruijn sequences
• On cross joining de Bruijn sequences
• On the Cayleyness of Praeger-Xu graphs
• On the classification of balanced binary sequences of period<tex>2^n-1</tex>(Corresp.)
• On the de Bruijn torus problem
• On Universal Cycles for k-Subsets of an n-Set
• On universal partial words
• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
• Perfect necklaces
• Periods in strings
• Pseudonoise sequences based on algebraic feedback shift registers
• Scattered Factor-Universality of Words
• The discrepancy of the lex-least de Bruijn sequence
• Universal cycles for combinatorial structures
• Universal cycles for permutations
• Universal partial tori
• Universal partial words over non-binary alphabets

This page was built for publication: The existence and structure of universal partial cycles

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