English
Related papers

Related papers: Inner tube formulas for polytopes

200 papers

Previous studies on the geometrical properties of the state space of a finite-level quantum system have determined its volume and surface area. Building on this foundation, we derive explicit formulas for two additional intrinsic volume…

Mathematical Physics · Physics 2025-11-17 Zsombor Szilágyi , Mihály Weiner

We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…

Computational Geometry · Computer Science 2018-06-18 Bin Fu , Pengfei Gu , Yuming Zhao

For a toric pair $(X, D)$, where $X$ is a projective toric variety of dimension $d-1\geq 1$ and $D$ is a very ample $T$-Cartier divisor, we show that the Hilbert-Kunz density function $HKd(X, D)(\lambda)$ is the $d-1$ dimensional volume of…

Algebraic Geometry · Mathematics 2017-08-15 Mandira Mondal , V. Trivedi

This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…

Metric Geometry · Mathematics 2007-05-23 Anna Felikson , Pavel Tumarkin

The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random…

Metric Geometry · Mathematics 2015-07-14 Michael B. McCoy , Joel A. Tropp

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos

The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…

Combinatorics · Mathematics 2019-08-20 Christopher Eur

We calculate the mean end-to-end distance ($R$) of a self-avoiding polymer encapsulated in an infinitely long cylinder with radius $D$. A self-consistent perturbation theory is used to calculate $R$ as a function of $D$ for impenetrable…

Soft Condensed Matter · Physics 2016-08-31 G. Morrison , D. Thirumalai

We give an upper bound on the volume vol(P*) of a polytope P* dual to a d-dimensional lattice polytope P with exactly one interior lattice point, in each dimension d. This bound, expressed in terms of the Sylvester sequence, is sharp, and…

Combinatorics · Mathematics 2016-11-09 Gabriele Balletti , Alexander M. Kasprzyk , Benjamin Nill

The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…

Combinatorics · Mathematics 2023-03-08 Marie-Charlotte Brandenburg , Sophia Elia , Leon Zhang

A $d$-dimensional lattice polytope $P$ is Gorenstein if it has a multiple $r P$ that is a reflexive polytope up to translation by a lattice vector. The difference $d+1-r$ is called the degree of $P$. We show that a Gorenstein polytope is a…

Combinatorics · Mathematics 2022-03-10 Benjamin Nill

We define and study the dual mixed volume rational function of a sequence of polytopes, a dual version of the mixed volume polynomial. This concept has direct relations to the adjoint polynomials and the canonical forms of polytopes. We…

Combinatorics · Mathematics 2024-10-30 Yibo Gao , Thomas Lam , Lei Xue

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…

Computational Geometry · Computer Science 2015-12-25 Alberto Del Pia , Carla Michini

We prove a Steiner formula for regular surfaces with no characteristic points in 3D contact sub-Riemannian manifolds endowed with an arbitrary smooth volume. The formula we obtain, which is equivalent to a half-tube formula, is of local…

Differential Geometry · Mathematics 2023-07-13 Davide Barilari , Tania Bossio

Let the \emph{double hyperbolic space} $\mathbb{DH}^n$, proposed in this paper as an extension of the hyperbolic space $\mathbb{H}^n$, contain a two-sheeted hyperboloid with the two sheets connected to each other along the boundary at…

Metric Geometry · Mathematics 2022-04-05 Lizhao Zhang

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…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

Let $d \geq 0$ be an integer and let $P \subset \mathbb R^d$ be a $d$-dimensional lattice polytope. We call a polytope $M \subset \mathbb R^d$ such that $M \subset P$ and $M \sim P$ a {\itshape miniature} of $P,$ and it is said to be…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Metric Geometry · Mathematics 2025-10-28 Steven Hoehner , Carsten Schütt , Elisabeth Werner

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…

Metric Geometry · Mathematics 2014-06-06 Michael Gene Dobbins