On the independence number of de Bruijn graphs
Abstract
We derive the asymptotic formula α(k,q)=λk-1qk+o(qk), where α(k,q) is the independence number of the de Bruijn graph B(k,q), and λk-1 is a constant arising from a variational problem on the unit (k-1)-dimensional cube. When k=4, we show the bounds 91/240 λ3 11/28. For odd prime k, we analyse the binary case q=2 via a phase reduction on rotation orbits. For k=11,13,17 this yields compact orbit-marker certificates for optimal constructions. Combined with a lifting theorem by Lichiardopol, these certificates give exact formulas for α(11,q), α(13,q), and α(17,q) for all q2, extending the known cases k=3,5,7.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.