🔮
🔮
The Ethereal
On the independence number of de Bruijn graphs
April 16, 2026 · Grace Period · + Add venue
Authors
Pietro Majer, Matteo Novaga
arXiv ID
2604.14671
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
0
Abstract
We derive the asymptotic formula $α(k,q)=λ_{k-1}q^k+o(q^k)$, 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\le λ_3\le 11/28$. For odd prime $k$, we analyse the binary case $q=2$ via a phase reduction on rotation orbits. For $k=11$ and $k=13$ this yields certified optimal constructions, which combined with a lifting theorem by Lichiardopol give exact formulas for $α(11,q)$ and $α(13,q)$ for all $q\ge2$, extending the known cases $k=3,5,7$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal