Discrete analogues of John's theorem

DOI10.2140/MOSCOW.2019.8.367zbMATH Open1447.11073arXiv1904.05280OpenAlexW3102350663WikidataQ127091091 ScholiaQ127091091MaRDI QIDQ2332797FDOQ2332797

Authors: Sören Lennart Berg, Martin Henk 

Publication date: 5 November 2019

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: As a discrete counterpart to the classical John theorem on the approximation of (symmetric) $n$-dimensional convex bodies $K$ by ellipsoids, Tao and Vu introduced so called generalized arithmetic progressions $P(A,b)subset{Z}^n$ in order to cover (many of) the lattice points inside a convex body by a simple geometric structure. Among others, they proved that there exists a generalized arithmetic progressions $P(A,b)$ such that $P(A,b)subsetKcap{Z}^{n}subsetP(A,O(n{)}^{3n/2}b)$. Here we show that this bound can be lowered to $n^{O(lnn)}$ and study some general properties of so called unimodular generalized arithmetic progressions.

Full work available at URL: https://arxiv.org/abs/1904.05280

Recommendations

• John-type theorems for generalized arithmetic progressions and iterated sumsets
• John's position is not good for approximation
• An arithmetic proof of John's ellipsoid theorem
• On contact points of convex bodies
• Approximation of convex bodies by centrally symmetric bodies

zbMATH Keywords

latticesarithmetic progressionsconvex bodiesJohn's theorem

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Lattices and convex bodies (number-theoretic aspects) (11H06)

Cites Work

• Successive-minima-type inequalities
• Asymptotic geometric analysis. I
• Convex Bodies The Brunn-MinkowskiTheory
• An optimization problem related to Minkowski's successive minima
• Title not available (Why is that?)
• An Introduction to the Geometry of Numbers
• John-type theorems for generalized arithmetic progressions and iterated sumsets
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• Unique determination of convex lattice sets
• A discrete analogue for Minkowski's second theorem on successive minima
• Simultaneous reduction of a lattice basis and its reciprocal basis
• Simultaneously good bases of a lattice and its reciprocal lattice
• Some inequalities related to the Seysen measure of a lattice
• On a discrete Brunn-Minkowski type inequality
• A discrete version of Koldobsky's slicing inequality

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sharp bounds for a discrete John's theorem
• On the independence number of sparser random Cayley graphs
• John-type theorems for generalized arithmetic progressions and iterated sumsets

This page was built for publication: Discrete analogues of John's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332797)