Rational generating-function conjecture for maximum independent sets of de Bruijn graphs
For a positive integer and a fixed diameter , let be the de Bruijn graph and let denote the number of maximum independent sets of . Consider its exponential generating function
Rational generating-function conjecture. If is a fixed odd prime number, then this exponential generating function is the ratio of two polynomials, each of degree . For , the paper proves the analogous assertion with numerator and denominator of degree at most ; the conjecture proposes the stated degree bound for every fixed odd prime diameter.
References
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
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.