The outerplane adjacency-polytope volume formula

Let GG be an outerplane graph. For each connected component GiG_i of GG, let Bi,1,,Bi,biB_{i,1},\dots,B_{i,b_i} be its blocks; let F(Bi,j)\mathscr{F}(B_{i,j}) denote the bounded faces of Bi,jB_{i,j}, let ewdBi,j\operatorname{ewd}{B_{i,j}} denote its extended weak dual, and let vFv_F be the vertex of this dual corresponding to FF. The normalized volume of the type-PQ adjacency polytope is denoted by NVol(GPQ)\operatorname{NVol}(\nabla^{\operatorname{PQ}}_G). Outerplane adjacency-polytope volume conjecture. For any outerplane graph GG,

NVol(GPQ)=i=1kj=1bi2V(Bi,j)2F(Bi,j)FF(Bi,j)degewdBi,j(vF).\operatorname{NVol}(\nabla^{\operatorname{PQ}}_G) = \prod_{i=1}^k \prod_{j=1}^{b_i} 2^{|V(B_{i,j})| - 2|\mathscr{F}(B_{i,j})|}\prod_{F \in \mathscr{F}(B_{i,j})} \deg_{\operatorname{ewd}{B_{i,j}}}(v_F).

The formula is proved for a proper but large class of outerplane graphs, namely those whose bounded faces are adjacent to the outer face, while experimental data suggests that it holds for all outerplane graphs; a proof remains open.

Sources & referencesView supporting material

Primary source

Robert Davis and Tianran Chen, “Computing Volumes of Adjacency Polytopes via Draconian Sequences”, arXiv:2007.11051 (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.