Generalized Andreev conjecture for trivalent hyperbolic polyhedra

Let PP be an abstract trivalent polyhedron with more than five faces, and let Θ:E(0,π)\Theta:\mathcal{E}\to(0,\pi) be a dihedral-angle function. A Whitehead pair is a pair of edges of PP belonging to a common face and having four distinct endpoints. A prismatic kk-circuit is a curve in the dual complex intersecting kk edges of PP and forming the usual prismatic circuit. Assume the following conditions hold:

  • If Γ\Gamma is the boundary of the union of two adjacent triangles of PP^* and intersects edges e1,e2,e3,e4e_1,e_2,e_3,e_4, with e1,e2e_1,e_2 and e3,e4e_3,e_4 both Whitehead pairs, then either Θ(e1)+Θ(e2)π\Theta(e_1)+\Theta(e_2)\leq\pi or Θ(e3)+Θ(e4)π\Theta(e_3)+\Theta(e_4)\leq\pi.
  • Whenever distinct edges e1,e2,e3e_1,e_2,e_3 meet at a vertex,
μ=13Θ(eμ)>π,\sum_{\mu=1}^3\Theta(e_\mu)>\pi,

and

Θ(e1)+Θ(e2)<Θ(e3)+π,Θ(e2)+Θ(e3)<Θ(e1)+π,Θ(e3)+Θ(e1)<Θ(e2)+π.\Theta(e_1)+\Theta(e_2)<\Theta(e_3)+\pi,\qquad \Theta(e_2)+\Theta(e_3)<\Theta(e_1)+\pi,\qquad \Theta(e_3)+\Theta(e_1)<\Theta(e_2)+\pi.
  • For every prismatic kk-circuit Γ\Gamma intersecting edges e1,,eke_1,\ldots,e_k,
μ=1kΘ(eμ)<(k2)π.\sum_{\mu=1}^k\Theta(e_\mu)<(k-2)\pi.

Generalized Andreev conjecture. There exists a compact convex hyperbolic polyhedron QQ combinatorially equivalent to PP whose dihedral angles are given by Θ\Theta, and QQ is unique up to isometries of H3\mathbb H^3. The conjecture would extend Andreev's characterization of compact convex hyperbolic polyhedra to this class of trivalent polyhedra, with the Whitehead-pair condition addressing the additional combinatorial obstruction. The supplied text does not state whether the conjecture has been resolved.

Sources & referencesView supporting material

Primary source

Ze Zhou, “Generalizing Andreev's Theorem via circle patterns”, arXiv:2308.14386 (2023).

Additional references

2 papers in this index state this conjecture (2020–2023). The statement above is taken from the most recent of them; the others are arXiv:2010.13076.

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.