Independence-number rationality conjecture for FI-graphs

About 2 years old · traced to

Let G∙G_{\bullet} be an FI⁡\operatorname{FI}-graph, and let α(Gn)\alpha(G_n) denote its independence number. Define the generating function

∑n≥0α(Gn)tn.\sum_{n \geq 0} \alpha(G_n)t^n.

Independence-number rationality conjecture. The generating function is rational. In particular, the function n↦α(Gn)n \mapsto \alpha(G_n) agrees with a quasi-polynomial for all n≫0n \gg 0.

This conjecture asks whether the extremal invariant given by independence numbers exhibits the same eventual regularity as counting invariants of FI⁡\operatorname{FI}-graphs. The paper provides experimental evidence, including a classification of FI⁡\operatorname{FI}-graphs with quadratically growing vertex sets, but no resolution is stated.

References

Primary source

David Guan and Eric Ramos, “Independence numbers in certain families of highly symmetric graphs”, arXiv:2401.16739 (2024).

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.