A simpler construction of volume polynomials for a polyhedron (Q1610979): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: S. A. Lavrenchenko / rank | |||
Property / author | |||
Property / author: Idzhad Kh. Sabitov / rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Ian Hartley / rank | |||
Property / author | |||
Property / author: S. A. Lavrenchenko / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Idzhad Kh. Sabitov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael Ian Hartley / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:03, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simpler construction of volume polynomials for a polyhedron |
scientific article |
Statements
A simpler construction of volume polynomials for a polyhedron (English)
0 references
20 August 2002
0 references
This article builds on earlier work to give a simple constructive proof of the existence of so-called ``volume polynomials'' for (triangulated) spherical polyhedra. For a polyhedron with a given combinatorial structure, a volume polynomial is a polynomial in \(V^2\) whose coefficients are fixed functions of the edge-lengths of the polyhedron, which has as a root the volume \(V\) of the polyhedron. An example is Franscesca's formula \[ \begin{multlined} 144V^2=-abc-ab'c'-a'bc'-a'b'c+(a+a'+b+b'-c-c')\\ cc'+(a+a'-b-b'+c+c')bb'+(-a- a'+b+b'+c+c')aa'\end{multlined} \] for the volume of the tetrahedron where \((a,a')\), \((b,b')\) and \((c,c')\) are pairs of squares of lengths of opposite edges. It was shown by \textit{I. Kh. Sabitov} [Fundam. Prikl. Mat. 2, 1235--1246 (1996; Zbl 0904.52002), Discrete Comput. Geom. 20, 405--425 (1998; Zbl 0922.52006)], that volume polynomials exist for all spherical triangulations. In the article under review, a simplification of the earlier proof is given, by proving and then using the fact that every triangulation of the 2-sphere contains a vertex which is not incident with any non-facial 3-cycle of edges. The final section of the article examines the case of triangulated toroids and shows under what circumstances they may be cut to yield triangulated spheres with properties the earlier sections show to be important in the search for low-degree volume polynomials.
0 references
volume polynomial
0 references
triangulation
0 references
2-sphere
0 references
torus
0 references