@techreport{a85c71108c05486a979e0303100f972f,

title = "A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence",

abstract = " We propose a novel construction for the well-known prefer-max De Bruijn sequence, based on the cycle joining technique. We further show that the construction implies known results from the literature in a straightforward manner. First, it implies the correctness of the onion theorem, stating that, effectively, the reverse of prefer-max is in fact an infinite De Bruijn sequence. Second, it implies the correctness of recently discovered shift rules for prefer-max, prefer-min, and their reversals. Lastly, it forms an alternative proof for the seminal FKM-theorem. ",

keywords = "cs.DM, math.CO",

author = "Gal Amram and Amir Rubin and Gera Weiss",

year = "2021",

language = "???core.languages.en_GB???",

series = "Arxiv preprint",

edition = "arXiv:2104.02999 [cs.DM]",

type = "WorkingPaper",

}