α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4.
Fredricksen,A survey of full length nonlinear shift register cycle algorithms, SIAM Rev.24(1982), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the independence number of de Bruijn graphs
α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4.