Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 48 min ago
Peer-reviewedLicence not statedDiscrete Applied Mathematics

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions

  1. 1University of Guelph, Canada
  2. 2Ontario Tech University, Canada
  3. 3Williams College, USA

Related

  1. A unified framework for existing and new constructions of Neumaier graphs
    Aida Abiad, Wouter Castryck, Maarten De Boeck +2
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Accelerated Concatenation of Stepsize Schedules for Smooth Strongly Convex Gradient Descent
    Zehao Zhang, Rujun Jiang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Extending structures for the linear framework of Universal Algebra with applications to transposed Poisson algebras
    Changhuan Liu, Tingfeng Wan, Guodong Zhou
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. A universal framework for Hopf algebras in combinatorics
    Farid Aliniaeifard, Stephanie van Willigenburg
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Concatenation Locality under Successive Adjacent Transpositions
    Adelin Ataba, Aryeh Lev Zabokritskiy
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@article{sawada2026concatenation,
  title = {{Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions}},
  author = {Joe Sawada and Jackson Sears and A. Trautrim and Aaron Williams},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  month = aug,
  doi = {10.1016/j.dam.2026.07.022},
  url = {http://arxiv.org/abs/2308.12405},
}
RIS
TY  - JOUR
TI  - Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
AU  - Joe Sawada
AU  - Jackson Sears
AU  - A. Trautrim
AU  - Aaron Williams
PY  - 2026
DA  - 2026/08/06
JO  - Discrete Applied Mathematics
DO  - 10.1016/j.dam.2026.07.022
UR  - http://arxiv.org/abs/2308.12405
SN  - 0166-218X
SN  - 1872-6771
ER  -