Related papers: The volume conjecture for polyhedra implies the St…
Two basic theorems of the theory of flexible polyhedra were proven by completely different methods: R. Alexander used analysis, namely, the Stokes theorem, to prove that the total mean curvature remains constant during the flex, while I.Kh.…
In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If $P$ is a simplicial $d$-polytope then its $h$-vector $(h_0,h_1,...,h_d)$ satisfies $h_0 \leq h_1 \leq ... \leq…
We formulate Vojta's conjecture for smooth weighted projective varieties, weighted multiplier ideal sheaves, and weighted log pairs and prove that all three versions of the conjecture are equivalent. In the process, we introduce generalized…
We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under two kinds of discrete subgroups of $O(3)$ of order four. We also characterize the convex bodies with the minimal volume product…
We develop a theory for the representation of opaque solids as volumes. Starting from a stochastic representation of opaque solids as random indicator functions, we prove the conditions under which such solids can be modeled using…
It is shown that the definition for the volume of stationary black holes advocated in hep-th/0508108 readily generalizes to the case of dilaton gravity in D=2. The dilaton field is included as part of the measure. A feature observed in D=3…
In this paper we give an introduction to the volume conjecture and its generalizations. Especially we discuss relations of the asymptotic behaviors of the colored Jones polynomials of a knot with different parameters to representations of…
Fox's conjecture (1962) states that the sequence of absolute values of the coefficients of the Alexander polynomial of alternating links is trapezoidal. While the conjecture remains open in general, a number of special cases have been…
It is proved that the simplex is a strict local minimum for the volume product, P(K)=min(vol(K) vol(K^z)), K^z is the polar body of K with respect to z, the minimum is taken over z in the interior of K, in the Banach-Mazur space of…
At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…
In 1960, Gr\"{u}nbaum proved that for any convex body $C\subset\mathbb{R}^d$ and every halfspace $H$ containing the centroid of $C$, one has that the volume of $H\cap C$ is at least a $\frac{1}{e}$-fraction of the volume of $C$. Recently,…
The Weak Gravity Conjecture is a nontrivial conjecture about quantum gravity that makes sharp, falsifiable predictions which can be checked in a broad range of string theory examples. However, in the presence of massless scalar fields…
Sperner's lemma is a statement about labeled triangulations of a simplex. McLennan and Tourky (2007) provided a novel proof of Sperner's Lemma by examining volumes of simplices in a triangulation under time-linear simplex-linear…
We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).
We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…
Given five points in a three-dimensional euclidean space, one can consider five tetrahedra, using those points as vertices. We present a pentagon-like formula containing the product of three volumes of those tetrahedra in its l.h.s. and the…
We prove a version of Poincar\'e's polyhedron theorem whose requirements are as local as possible. New techniques such as the use of discrete groupoids of isometries are introduced. The theorem may have a wide range of applications and can…
We give a characterization of the minimal tropical half-spaces containing a given tropical polyhedron, from which we derive a counter example showing that the number of such minimal half-spaces can be infinite, contradicting some statements…
We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…