English
Related papers

Related papers: Polytopes of Maximal Volume Product

200 papers

Using $\delta$-invariants and Newton--Okounkov bodies, we derive the optimal volume upper bound for K\"ahler manifolds with positive Ricci curvature, from which we get a new characterization of the complex projective space.

Differential Geometry · Mathematics 2020-09-30 Kewei Zhang

We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…

Metric Geometry · Mathematics 2020-10-09 John A. Messina , Pablo Soberón

Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…

Combinatorics · Mathematics 2016-03-14 Ian Gleason , Isabel Hubard

Let $1\leq i \leq k < n$ be integers. We prove the following exact inequalities for any convex body $K\subset\mathbb{R}^n$ with centroid at the origin, and any $k$-dimensional subspace $E\subset \mathbb{R}^n$: \begin{align*} &V_i \big(…

Metric Geometry · Mathematics 2018-09-18 Matthew Stephen , Vladyslav Yaskin

We prove that for any $n\in \mathbb{N}$ there is a convex body $K\subseteq \mathbb{R}^n$ whose surface area is at most $n^{\frac12+o(1)}$, yet the translates of $K$ by the integer lattice $\mathbb{Z}^n$ tile $\mathbb{R}^n$.

Metric Geometry · Mathematics 2023-01-10 Assaf Naor , Oded Regev

We present a software suite for the analysis and optimization of ideal convex polyhedra in hyperbolic 3-space $\mathbb{H}^3$. Using Rivin's variational characterization of ideal polyhedra, we develop efficient algorithms for checking…

Geometric Topology · Mathematics 2025-12-12 Igor Rivin

In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…

Numerical Analysis · Mathematics 2010-10-19 Zhiqiang Xu

Let $\Delta_n$ and $Q_n$ denote the regular $n$-simplex of side length $\sqrt{2}$ embedded in $\mathbb{R}^{n+1}$ and the volume one cube in $\mathbb{R}^n$, respectively. We derive a closed-form formula for the hyperplane volume projections…

Metric Geometry · Mathematics 2026-01-27 Christos Pandis

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

Computational Geometry · Computer Science 2007-05-23 Rina Panigrahy

It is proved that for a symmetric convex body K in R^n, if for some tau > 0, |K cap (x+tau K)| depends on ||x||_K only, then K is an ellipsoid. As a part of the proof, smoothness properties of convolution bodies ls are studied.

Functional Analysis · Mathematics 2016-09-06 Mathieu Meyer , Shlomo Reisner , M. Schmuckenschlager

We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…

Algebraic Geometry · Mathematics 2024-10-16 Ivan Soprunov , Jenya Soprunova

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

We provide a natural generalization of a geometric conjecture of F\'{a}ry and R\'{e}dei regarding the volume of the convex hull of $K \subset {\mathbb R}^n$, and its negative image $-K$. We show that it implies Godbersen's conjecture…

Metric Geometry · Mathematics 2014-08-12 S. Artstein-Avidan , K. Einhorn , D. Y. Florentin , Y. Ostrover

In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…

Differential Geometry · Mathematics 2020-10-23 Jian Ge

Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in their interior. We prove several equalities for the…

Combinatorics · Mathematics 2019-10-22 Clemens Huemer , Deborah Oliveros , Pablo Pérez-Lantero , Ferran Torra , Birgit Vogtenhuber

We prove results relative to the problem of finding sharp bounds for the affine invariant $P(K)=V(\Pi K)/V^{d-1}(K)$. Namely, we prove that if $K$ is a 3-dimensional zonoid of volume 1, then its second projection body $\Pi^2K$ is contained…

Metric Geometry · Mathematics 2014-09-17 Christos Saroglou

We show that the volume of a convex body in $\mathbb{R}^{n}$ in the general membership oracle model can be computed to within relative error $\varepsilon$ using $\widetilde{O}(n^{3.5}\psi^{2} + n^3/\varepsilon^{2})$ oracle queries, where…

Data Structures and Algorithms · Computer Science 2024-08-30 He Jia , Aditi Laddha , Yin Tat Lee , Santosh S. Vempala

A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…

Combinatorics · Mathematics 2018-11-09 Gabriele Balletti

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

Computational Geometry · Computer Science 2024-12-18 Hernán González-Aguilar , David Orden , Pablo Pérez-Lantero , David Rappaport , Carlos Seara , Javier Tejel , Jorge Urrutia

The first author showed that for a given point $p$ in an $nk$-polytope $P$ there are $n$ points in the $k$-faces of $P$, whose barycenter is $p$. We show that we can increase the dimension of $P$ by $r$, if we allow $r$ of the points to be…

Metric Geometry · Mathematics 2018-09-06 Michael Gene Dobbins , Florian Frick