English
Related papers

Related papers: Lattice-point enumerators of ellipsoids

200 papers

We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…

Metric Geometry · Mathematics 2011-10-20 Martin Henk , Achill Schuermann , Joerg M. Wills

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Number Theory · Mathematics 2013-11-13 Samuel Holmin

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

We find an optimal upper bound on the volume of the John ellipsoid of a $k$-dimensional section of the $n$-dimensional cube, and an optimal lower bound on the volume of the L\"owner ellipsoid of a projection of the $n$-dimensional…

Functional Analysis · Mathematics 2017-09-26 Grigory Ivanov

The Betke-Henk-Wills conjecture proposes a sharp upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture remains open for general convex bodies in dimensions $d…

General Mathematics · Mathematics 2026-02-12 Chao Wang

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

Functional Analysis · Mathematics 2021-04-13 Biagio Ricceri

We establish Central Limit Theorems for the volumes of intersections of $B_{p}^n$ (the unit ball of $\ell_p^n$) with uniform random subspaces of codimension $d$ for fixed $d$ and $n\to \infty$. As a corollary we obtain higher order…

Probability · Mathematics 2022-06-30 Radosław Adamczak , Peter Pivovarov , Paul Simanjuntak

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

Probability · Mathematics 2017-06-12 Nicola Turchi , Florian Wespi

$L_p$ Brunn-Minkowski type inequa\-li\-ties for the lattice point enumerator $\mathrm{G}_n(\cdot)$ are shown, both in a geometrical and in a functional setting. In particular, we prove that \[\mathrm{G}_n\bigl((1-\lambda)\cdot K +_p…

Metric Geometry · Mathematics 2021-05-25 María A. Hernández Cifre , Eduardo Lucas , Jesús Yepes Nicolás

Lattice coverings in the real plane by Minkowski balls are studied. We exploit the duality of admissible lattices of Minkowski balls and inscribed convex symmetric hexagons of these balls. An explicit moduli space of the areas of these…

Number Theory · Mathematics 2023-12-07 Nikolaj Glazunov

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

$ \newcommand{\R}{\mathbb{R}} \newcommand{\lat}{\mathcal{L}} $We prove a conjecture due to Dadush, showing that if $\lat \subset \R^n$ is a lattice such that $\det(\lat') \ge 1$ for all sublattices $\lat' \subseteq \lat$, then \[ \sum_{\vec…

Metric Geometry · Mathematics 2022-07-08 Oded Regev , Noah Stephens-Davidowitz

A family of homothets of an o-symmetric convex body K in d-dimensional Euclidean space is called a Minkowski arrangement if no homothet contains the center of any other homothet in its interior. We show that any pairwise intersecting…

Metric Geometry · Mathematics 2020-02-25 Márton Naszódi , Konrad J. Swanepoel

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

Combinatorics · Mathematics 2016-12-30 Gabriele Balletti , Alexander M. Kasprzyk

Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…

Metric Geometry · Mathematics 2013-05-14 S. S Kutateladze

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

Metric Geometry · Mathematics 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

Functional Analysis · Mathematics 2007-05-23 Ravi Montenegro

A lattice $\Lambda$ is said to be an extension of a sublattice $L$ of smaller rank if $L$ is equal to the intersection of $\Lambda$ with the subspace spanned by $L$. The goal of this paper is to initiate a systematic study of the geometry…

Metric Geometry · Mathematics 2023-12-19 Maxwell Forst , Lenny Fukshansky

For special $d$-dimensional hyperbolic shells $E$ with $ d\geq 5$ we show that the number of lattice points in $E$ intersected with a $d$-dimensional cube $C_r$ of edge length $r$, can be approximated by the volume of $E\cap C_r$, as $r$…

Number Theory · Mathematics 2007-05-23 Guido Elsner

We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…

Metric Geometry · Mathematics 2008-08-11 Matija Cencelj , Dušan Repovš , Mikhail Skopenkov
‹ Prev 1 3 4 5 6 7 10 Next ›