English
Related papers

Related papers: Lattice Points in Large Borel Sets and Successive …

200 papers

First we adjust a technique due to Jim\'enez-Rodr\'iguez to prove the complete latticeability of the set of disjoint non-norm null weakly null sequences and of the set of disjoint non-norm null regular-polynomially null sequences in Banach…

Functional Analysis · Mathematics 2020-07-10 Geraldo Botelho , José Lucas P. Luiz

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Combinatorics · Mathematics 2021-03-16 Boris Bukh , Ting-Wei Chao , Ron Holzman

Let ${\bf C}$ be a smooth geometrically connected projective curve over a finite field, and let $A$ be the affine algebra of its regular functions outside a fixed place of ${\bf C}$. We give precise relationships between the Mahler…

Algebraic Geometry · Mathematics 2025-11-03 Jean-Benoît Bost , Frédéric Paulin

We give bounds on the successive minima of an $o$-symmetric convex body under the restriction that the lattice points realizing the successive minima are not contained in a collection of forbidden sublattices. Our investigations extend…

Metric Geometry · Mathematics 2016-01-20 Martin Henk , Carsten Thiel

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

Denoting by $\mathcal{E}\subseteq \R^2$ the set of the pairs $(\lambda_1(\Omega),\lambda_2(\Omega))$ for all the open sets $\Omega\subseteq\R^N$ with unit measure, and by $\Theta\subseteq\R^N$ the union of two disjoint balls of half…

Optimization and Control · Mathematics 2015-06-03 Lorenzo Brasco , Carlo Nitsch , Aldo Pratelli

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

Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…

Algebraic Geometry · Mathematics 2010-10-05 Martin Kreidl

We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…

Combinatorics · Mathematics 2024-01-31 Dwight Duffus , Bill Sands

We obtain isoperimetric stability theorems for general Cayley digraphs on $\mathbb{Z}^d$. For any fixed $B$ that generates $\mathbb{Z}^d$ over $\mathbb{Z}$, we characterise the approximate structure of large sets $A$ that are approximately…

Combinatorics · Mathematics 2020-09-28 Ben Barber , Joshua Erde , Peter Keevash , Alexander Roberts

Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…

Number Theory · Mathematics 2020-11-30 Lenny Fukshansky , Pavel Guerzhoy , Stefan Kuehnlein

Models of two-dimensional (2D) traps, with the double-well structure in the third direction, for Bose-Einstein condensate (BEC) are introduced, with attractive or repulsive interactions between atoms. The models are based on systems of…

Pattern Formation and Solitons · Physics 2009-11-13 Arthur Gubeskys , Boris A. Malomed

We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…

Combinatorics · Mathematics 2011-04-26 Benjamin Nill , Günter M. Ziegler

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Miroslav Ploscica

Erd\"{o}s proved that for every infinite $X \subseteq \mathbb{R}^d$ there is $Y \subseteq X$ with $|Y|=|X|$, such that all pairs of points from $Y$ have distinct distances, and he gave partial results for general $a$-ary volume. In this…

Logic · Mathematics 2018-07-19 William Gasarch , Douglas Ulrich

We give a short and simple proof of a recent result of Dobbins that any point in an $nd$-polytope is the barycenter of $n$ points in the $d$-skeleton. This new proof builds on the constraint method that we recently introduced to prove…

Metric Geometry · Mathematics 2015-11-16 Pavle V. M. Blagojević , Florian Frick , Günter M. Ziegler

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…

Combinatorics · Mathematics 2013-10-01 Gyula O. H. Katona , Dániel T. Nagy

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$…

Metric Geometry · Mathematics 2016-03-21 J. A. De Loera , R. N. La Haye , D. Rolnick , P. Soberón