一个循环连接构造的E-Max De Bruijn序列
A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence
摘要：
我们提出了一种新的建设著名的prefer-max德Bruijn序列，基于循环连接技术。我们进一步表明，建设意味着已知的结果，从文献中以一种简单的方式。首先，它暗示了洋葱定理的正确性，指出prefer-max的逆实际上是一个无限的De Bruijn序列。其次，它意味着最近发现的prefer-max，prefer-min及其反转的移位规则的正确性。最后，它形成了一个替代证明的开创性FKM定理。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
