Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra (Q634724): Difference between revisions

Building on his previous work [``Volume estimates for equiangular hyperbolic Coxeter polyhedra'', Algebr. Geom. Topol. 9, No. 2, 1225--1254 (2009; Zbl 1170.57012)], the author of this paper proves a substantial collection of results pertaining to upper and lower bounds for non-obtuse hyperbolic polyhedra. The techniques employed include the proof of Thurston's Orbifold Theorem [\textit{M. Boileau} and \textit{J. Porti}, Geometrization of 3-orbifolds of cyclic type. Astérisqe. 272. Paris: Société Mathématique de France (2001; Zbl 0971.57004) and \textit{D. Cooper}, \textit{C. D. Hodgson}, and \textit{S. P. Kerckhoff}, Three-dimensional orbifolds and cone-manifolds. MSJ Memoirs. 5. Tokyo: Mathematical Society of Japan (2000; Zbl 0955.57014)]), Andreev's Theorem (see for example, [\textit{R. K. W. Roeder}, \textit{J. H. Hubbard}, and \textit{W. D. Dunbar}, ``Andreev's theorem on hyperbolic polyhedra'', Ann. Inst. Fourier 57, No. 3, 825--882 (2007; Zbl 1127.51012)]), Schläfli's formula [\textit{I. Rivin}, ``Euclidean structures on simplicial surfaces and hyperbolic volume'', Ann. Math. (2) 139, No. 3, 553--580 (1994; Zbl 0823.52009)], as well as recent results (which depend on Perelman's proof of the Thurston Geometrization Theorem) due to [\textit{I. Agol}, \textit{P. A. Storm}, \textit{W. P. Thurston}, with appendix by \textit{N. Dunfield}, ``Lower bounds on volumes of hyperbolic Haken 3-manifolds'', J. Am. Math. Soc. 20, No. 4, 1053--1077 (2007; Zbl 1155.58016)]. The principal result of the paper gives, for any hyperbolic polyhedron with non-obtuse dihedral angles, a two-sided volume bound that is combinatorial and depends only on the 1-skeleton of the polyhedron. Other results include (1) a characterization of the smallest-volume Coxeter \(n\)-prism (polyhedra with the combinatorial type of an \(n\)-gon crossed with an interval and all of whose dihedral angles are integer submultiples of \(\pi\)) for each \(n \geq 4\), (2) a classification of all Seifert-fibered polyhedral 3-orbifolds, and (3) a constructive algorithm that detects the geometric decomposition of the 3-orbifold corresponding to any Coxeter polyhedron.