The rational generating-function denominator conjecture for hard squares on cylinders

About 14 years old · traced to

Let PmP_m be the path graph on mm vertices and CnC_n the cycle graph on nn vertices. For a graph GG, let Ind⁡(G)\operatorname{Ind}(G) be its independence complex, define Z(G)=1−χ(Ind⁡(G))Z(G)=1-\chi(\operatorname{Ind}(G)), and set

fn(t)=∑m=0∞Z(Pm×Cn)tm.f_n(t)=\sum_{m=0}^{\infty} Z(P_m\times C_n)t^m.

Generating-function denominator conjecture. For every n≥0n\geq 0, there are polynomials hn(t)h_n(t) such that

f4n+2(t)=h4n+2(t)(1+t2)⋅[(1−t8n−2)(1−t8n−8)(1−t8n−14)⋯(1−t2n+4)],f_{4n+2}(t)=\frac{h_{4n+2}(t)}{(1+t^2)\cdot\big[(1-t^{8n-2})(1-t^{8n-8})(1-t^{8n-14})\cdots(1-t^{2n+4})\big]}, f4n(t)=h4n(t)(1−t2)⋅[(1−t8n−6)(1−t8n−12)(1−t8n−18)⋯(1−t2n+6)].f_{4n}(t)=\frac{h_{4n}(t)}{(1-t^2)\cdot\big[(1-t^{8n-6})(1-t^{8n-12})(1-t^{8n-18})\cdots(1-t^{2n+6})\big]}.

Here, in each denominator, the displayed exponents decrease by 66. The preceding theorem establishes that each f2n(t)f_{2n}(t) is rational with denominator roots of unity; this conjecture predicts explicit denominator factors and would give more precise polynomial-growth information for the Witten-index sequences of hard-square models on even-circumference cylinders.

References

Primary source

Michal Adamaszek, “Hard squares on cylinders revisited”, arXiv:1202.1655 (2012).

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.