English
Related papers

Related papers: Minimal volume $k$-point lattice $d$-simplices

200 papers

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c$ that to the interior of $\mathcal{P}$. It follows from a lower…

Combinatorics · Mathematics 2023-01-25 Ichiro Sainose , Ginji Hamano , Tatsuo Emura , Takayuki Hibi

Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…

Combinatorics · Mathematics 2024-11-12 Ginji Hamano , Ichiro Sainose , Takayuki Hibi

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

In 1982, Zaks, Perles and Wills discovered a d-dimensional lattice simplex S_{d,k} with k interior lattice points, whose volume is linear in k and doubly exponential in the dimension d. It is conjectured that, for all d \ge 3 and k \ge 1,…

Combinatorics · Mathematics 2018-03-14 Gennadiy Averkov

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

Combinatorics · Mathematics 2017-10-25 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

In this paper we show how to use elementary methods to prove that the volume of Sl_k R / Sl_k Z is zeta(2) * zeta(3) * ... * zeta(k) / k. Using a version of reduction theory presented in this paper, we can compute the volumes of certain…

Number Theory · Mathematics 2009-09-02 Henri Gillet , Daniel R. Grayson

For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…

Combinatorics · Mathematics 2014-12-16 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

Let $\mathcal{T}^d(1)$ be the set of all $d$-dimensional simplices $T$ in $\real^d$ with integer vertices and a single integer point in the interior of $T$. It follows from a result of Hensley that $\mathcal{T}^d(1)$ is finite up to affine…

Metric Geometry · Mathematics 2012-03-14 Gennadiy Averkov

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

Combinatorics · Mathematics 2018-01-04 Martin Balko , Josef Cibulka , Pavel Valtr

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…

Combinatorics · Mathematics 2011-11-09 Victor Batyrev , Benjamin Nill

Let $K \subset \mathbb R^n$ be a convex body with barycenter at the origin. We show there is a simplex $S \subset K$ having also barycenter at the origin such that $\left(\frac{vol(S)}{vol(K)}\right)^{1/n} \geq \frac{c}{\sqrt{n}},$ where…

Metric Geometry · Mathematics 2019-07-18 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.

Combinatorics · Mathematics 2017-02-07 Filip Cools , Alexander Lemmens

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

Optimization and Control · Mathematics 2012-10-12 Fabrizio Dabbene , Didier Henrion

We show by a direct construction that there are at least $\exp\{cV^{(d-1)/(d+1)}\}$ convex lattice polytopes in $\mathbb{R}^d$ of volume $V$ that are different in the sense that none of them can be carried to an other one by a lattice…

Combinatorics · Mathematics 2014-03-06 Imre Barany , Liping Yuan

Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

We prove minimal entropy rigidity for complete, finite volume manifolds locally isometric to a product of rank one symmetric spaces of dimension at least 3: the locally symmetric metric uniquely minimizes (normalized) entropy among all…

Differential Geometry · Mathematics 2007-05-23 Christopher Connell , Benson Farb

We describe the minimal configurations of the compact D=11 Supermembrane and D-branes when the spatial part of the world-volume is a K\"ahler manifold. The minima of the corresponding hamiltonians arise at immersions into the target space…

High Energy Physics - Theory · Physics 2007-05-23 J. Bellorin , A Restuccia

The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…

Metric Geometry · Mathematics 2022-06-22 Bushra Basit , Zsolt Langi

Maxwell introduced a necessary minimum number of edges in terms of the number of vertices required for a graph to yield a Euclidean rigid generic framework in $\mathbb{R}^3$, this count was generalised to $\mathbb{R}^d$, for all $d\geq 1$.…

Combinatorics · Mathematics 2023-06-27 Jack Southgate
‹ Prev 1 2 3 10 Next ›