Subparking-function and acyclic-cut orientation conjecture for graph Tutte polynomials

Let GG be a graph, let qV(G)q\in V(G) be a sink, and let TT be an ordered, qq-rooted spanning tree of GG. For UVq(G)U\subseteq V^{q}(G), write

xU,T:=uUxudU,TG(u),dU,TG(u):={e={u,v}E(U,Uc):e is not the minimum edge in E(U,Uc)},\mathbf{x}^{U,T}:=\prod_{u\in U}x_u^{d^{G}_{U,T}(u)},\qquad d^{G}_{U,T}(u):=\left|\{e=\{u,v\}\in E(U,U^c):e\text{ is not the minimum edge in }E(U,U^c)\}\right|,

and let I(G,q,T)1=xU,T:UVq(G)I^{-1}_{(G,q,T)}=\langle \mathbf{x}^{U,T}:\emptyset\ne U\subseteq V^{q}(G)\rangle. Let PF(G,q,T)\mathrm{PF}^{-}(G,q,T) be the set of (G,q,T)(G,q,T)-subparking functions, and let ACI(G,q,T)\mathrm{ACI}(G,q,T) be the set of acyclic-cut internal partial orientations of the rooted graph. Write RR for the polynomial ring in the variables xux_u indexed by Vq(G)V^{q}(G), gg for the genus of GG, and DOD_{\mathcal O} for the divisor associated with an acyclic-cut internal partial orientation O\mathcal O.

Subparking-function and acyclic-cut orientation conjecture. For any graph GG and choice of sink qV(G)q\in V(G), there exists an ordered, qq-rooted spanning tree TT of GG such that

Hilb(R/I(G,q,T)1;y)=ygTG(0,1/y)\operatorname{Hilb}(R/I^{-1}_{(G,q,T)};y)=y^{g}\cdot T_G(0,1/y)

and

PF(G,q,T)={(DO)ZVq(G):OACI(G,q,T)}.\mathrm{PF}^{-}(G,q,T)=\{(D_{\mathcal O})_{\mathbb ZV^{q}(G)}:\mathcal O\in\mathrm{ACI}(G,q,T)\}.

This conjecture proposes a spanning-tree ordering simultaneously realizing the Tutte-polynomial Hilbert series and identifying subparking functions with divisors arising from acyclic-cut internal partial orientations. The parser supplies no evidence of resolution, so its status is open.

Sources & referencesView supporting material

Primary source

Spencer Backman and Sam Hopkins, “Fourientations and the Tutte Polynomial”, arXiv:1503.05885 (2015).

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.