English
Related papers

Related papers: Towards Strong Reverse Minkowski-type Inequalities…

200 papers

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…

Combinatorics · Mathematics 2025-03-04 Christopher Bouchard

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

Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…

Number Theory · Mathematics 2021-11-16 Christian Porter , Cong Ling

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…

Number Theory · Mathematics 2013-08-19 Lenny Fukshansky , Glenn Henshaw

In this paper we consider Riemannian manifolds of dimension at least $3$, with nonnegative Ricci curvature and Euclidean Volume Growth. For every open bounded subset with smooth boundary we establish the validity of an optimal Minkowski…

Differential Geometry · Mathematics 2024-11-06 Luca Benatti , Mattia Fogagnolo , Lorenzo Mazzieri

We prove that if $\mathcal{L} \subset \mathbb{R}^n$ is a lattice such that $\det(\mathcal{L}') \geq 1$ for all sublattices $\mathcal{L}' \subseteq \mathcal{L}$, then \[ \sum_{\substack{\mathbf{y}\in\mathcal{L}\\\mathbf{y}\neq\mathbf0}}…

Metric Geometry · Mathematics 2022-10-04 Yael Eisenberg , Oded Regev , Noah Stephens-Davidowitz

An upper bound on the error probability of specific lattices, based on their distance-spectrum, is constructed. The derivation is accomplished using a simple alternative to the Minkowski-Hlawka mean-value theorem of the geometry of numbers.…

Information Theory · Computer Science 2013-01-03 Yuval Domb , Meir Feder

It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…

Combinatorics · Mathematics 2017-04-06 Akihiro Higashitani

We consider the isoperimetric inequality on the class of high-dimensional isotropic convex bodies. We establish quantitative connections between two well-known open problems related to this inequality, namely, the thin shell conjecture, and…

Metric Geometry · Mathematics 2013-05-14 Ronen Eldan

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…

Metric Geometry · Mathematics 2020-04-29 Bernardo González Merino , Matthias Schymura

It is a classical fact, that given an arbitrary n-dimensional convex body, there exists an appropriate sequence of Minkowski symmetrizations (or Steiner symmetrizations), that converges in Hausdorff metric to a Euclidean ball. Here we…

Metric Geometry · Mathematics 2007-05-23 B. Klartag

A classical theorem of Minkowski and Hlawka states that there exists a lattice in R^n with packing density at least 2^{1-n}. Buser and Sarnak proved the analogue of this result in the context of complex abelian varieties. Here we give an…

Number Theory · Mathematics 2014-07-14 Pascal Autissier

We asymptotically estimate the variance of the number of lattice points in a thin, randomly rotated annulus lying on the surface of the sphere. This partially resolves a conjecture of Bourgain, Rudnick, and Sarnak. We also obtain estimates…

Number Theory · Mathematics 2022-07-25 Peter Humphries , Maksym Radziwiłł

Fix an positive integer $n$. Let $K\subseteq\mathbb{R}^n$ be a compact set such that $K+\mathbb{Z}^n=\mathbb{R}^n$. We prove, via Algebraic Topology, that the integer points of the difference set of $K$, $(K-K)\cap\mathbb{Z}^n$, is not…

Number Theory · Mathematics 2010-07-13 Zeljka Ljujic , Camilo Sanabria

We compare for an $n$-dimensional Euclidean lattice $\Lb$ the smallest possible values of the product of the norms of $n$~vectors which either constitute a basis for $\Lb$ (Hermite-type inequalities) or are merely assumed to be independent…

Number Theory · Mathematics 2014-03-07 Jacques Martinet

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

Metric Geometry · Mathematics 2015-10-12 Márton Naszódi

We observe some higher order Poincare-type inequalities on a closed manifold, which is inspired by Hurwitz's proof of the Wirtinger's inequality using Fourier theory. We then give some geometric implication of these inequalities by applying…

Differential Geometry · Mathematics 2021-03-22 Kwok-Kun Kwong

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Number Theory · Mathematics 2016-09-07 Vidmantas Bentkus , Friedrich Götze

Let $\| \cdot \|$ be the euclidean norm on ${\bf R}^n$ and $\gamma_n$ the (standard) Gaussian measure on ${\bf R}^n$ with density $(2 \pi )^{-n/2} e^{- \| x\|^2 /2}$. Let $\vartheta$ ($ \simeq 1.3489795$) be defined by $\gamma_1 ([ -…

Metric Geometry · Mathematics 2016-09-06 W. Banaszczyk , Stanislaw J. Szarek

We give an $O(\log^2 n)$-query algorithm for finding a Tarski fixed point over the $4$-dimensional lattice $[n]^4$, matching the $\Omega(\log^2 n)$ lower bound of [EPRY20]. Additionally, our algorithm yields an ${O(\log^{\lceil…

Computational Complexity · Computer Science 2026-04-02 Xi Chen , Yuhao Li , Mihalis Yannakakis
‹ Prev 1 3 4 5 6 7 10 Next ›