The outerplane adjacency-polytope volume formula
The outerplane adjacency-polytope volume formula
Let be an outerplane graph. For each connected component of , let be its blocks; let denote the bounded faces of , let denote its extended weak dual, and let be the vertex of this dual corresponding to . The normalized volume of the type-PQ adjacency polytope is denoted by . Outerplane adjacency-polytope volume conjecture. For any outerplane graph ,
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.