ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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 ewd⁡Bi,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=1k∏j=1bi2∣V(Bi,j)∣−2∣F(Bi,j)∣∏F∈F(Bi,j)deg⁡ewd⁡Bi,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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.