A.P. Mani and R.J. Stones' conjecture for the Tutte polynomial of complete graphs

About 5 years old · traced to

Let T(Kn;a,b)T(K_n;a,b) denote the Tutte polynomial of the complete graph KnK_n, and let pp be an odd prime and kk a positive integer. Let u u denote congruence modulo the indicated power of pp. A.P. Mani and R.J. Stones' conjecture. If n≥pkn\geq p^k, a,b∈Za,b\in\mathbb{Z}, and b≢1(modp)b\not\equiv 1\pmod p, then

T(Kn;a,b)≡{bϕ(p)2−1if p≥3, n=p, and a≡1(modp),bϕ(pk)2T(Kn−ϕ(pk);a,b)otherwise(modp).T(K_n;a,b)\equiv\begin{cases} b^{\frac{\phi(p)}{2}-1} & \text{if }p\geq 3,\ n=p,\text{ and }a\equiv 1\pmod p,\\ b^{\frac{\phi(p^k)}{2}}T(K_{n-\phi(p^k)};a,b) & \text{otherwise} \end{cases}\pmod p.

If n≥pkn\geq p^k, a,b∈Za,b\in\mathbb{Z}, and b≡1(modp)b\equiv 1\pmod p, then

T(Kn;a,b)≡{(n+a−1)pkT(Kn−pk;a,b)n>pk,(a−1)pk−1n=pk(modpk).T(K_n;a,b)\equiv\begin{cases} (n+a-1)^{p^k}T(K_{n-p^k};a,b) & n>p^k,\\ (a-1)^{p^k-1} & n=p^k \end{cases}\pmod {p^k}.

This conjecture refines the known congruence for Tn(1,b)T_n(1,b) modulo prime powers by proposing recurrences for the complete-graph Tutte polynomial with general integer parameters aa and bb. The supplied source does not establish a resolution, so the conjecture is recorded as open.

References

Primary source

Tomer Kotek and Johann A. Makowsky, “On the Tutte and matching polynomials for complete graphs”, arXiv:2112.06581 (2022).

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.