Rational generating-function conjecture for maximum independent sets of de Bruijn graphs

For a positive integer dd and a fixed diameter DD, let B(d,D)B(d,D) be the de Bruijn graph and let ad,Da_{d,D} denote the number of maximum independent sets of B(d,D)B(d,D). Consider its exponential generating function

d=1ad,Dtdd!.\sum_{d=1}^{\infty}\frac{a_{d,D}t^d}{d!}.

Rational generating-function conjecture. If DD is a fixed odd prime number, then this exponential generating function is the ratio of two polynomials, each of degree D1D-1. For D=3D=3, the paper proves the analogous assertion with numerator and denominator of degree at most 22; the conjecture proposes the stated degree bound for every fixed odd prime diameter.

Sources & referencesView supporting material

Primary source

Dustin A. Cartwright, Maria Angelica Cueto and Enrique A. Tobis, “The maximum independent sets of de Bruijn graphs of diameter 3”, arXiv:0905.3820 (2010).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.