Related papers: Volume of 4-polytopes from bivectors
In 3-dimensional hyperbolic geometry, the classical Schlafli formula expresses the variation of the volume of a hyperbolic polyhedron in terms of the length of its edges and of the variation of its dihedral angles. We prove a similar…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
Given a connected real Lie group and a contractible homogeneous proper $G$--space $X$ furnished with a $G$--invariant volume form, a real valued volume can be assigned to any representation $\rho\colon \pi_1(M)\to G$ for any oriented closed…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…
We study the group of birational automorphisms of the $n$-dimensional projective space that preserve the standard torus invariant volume form with logarithmic poles. We prove that this group is not generated by pseudo-regularizable maps for…
A polytope is called a Coxeter polytope if its dihedral angles are integer parts of $\pi$. In this paper we prove that if a non-compact Coxeter polytope of finite volume in $H^n$ has exactly $n+3$ facets then $n\le 16$. We also find an…
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…
Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…
We study exact, volume-preserving diffeomorphisms that have heteroclinic connections between a pair of normally hyperbolic invariant manifolds. We develop a general theory of lobes, showing that the lobe volume is given by an integral of a…
The equations of motion of a mechanical system subjected to nonholonomic linear constraints can be formulated in terms of a linear almost Poisson structure in a vector bundle. We study the existence of invariant measures for the system in…
We prove a scale of generalized $L^p$-Poincar\'e inequalities and Sobolev type inequalities on graphs with polynomial volume growth. They are optimal on Vicsek graphs.
Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…
The volume of a Cartier divisor is an asymptotic invariant, which measures the rate of growth of sections of powers of the divisor. It extends to a continuous, homogeneous, and log-concave function on the whole N\'eron--Severi space, thus…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…
We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…
Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…