On the independence number of de Bruijn graphs
arXiv:2604.14671
Abstract
We derive the asymptotic formula , where is the independence number of the de Bruijn graph , and is a constant arising from a variational problem on the unit -dimensional cube. When , we show the bounds . For odd prime , we analyse the binary case via a phase reduction on rotation orbits. For this yields compact orbit-marker certificates for optimal constructions. Combined with a lifting theorem by Lichiardopol, these certificates give exact formulas for , , and for all , extending the known cases .
arXiv comment34 pages