English
Related papers

Related papers: An upper bound on the minimal dispersion

200 papers

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

This paper studies visibility problems in Euclidean spaces $\mathbb{R}^d$ where the obstacles are the points of infinite discrete sets $Y\subseteq\mathbb{R}^d$. A point $x\in\mathbb{R}^d$ is called $\varepsilon$-visible for $Y$ (notation:…

Metric Geometry · Mathematics 2018-05-31 Michael Boshernitzan , Yaar Solomon

We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the…

Computational Geometry · Computer Science 2009-11-23 Adrian Dumitrescu , Minghui Jiang

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

Combinatorics · Mathematics 2025-10-06 Paata Ivanisvili , Ohad Klein , Roman Vershynin

We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…

Probability · Mathematics 2009-11-11 V. Shcherbakov

If $x_1,\dots,x_m$ are finitely many points in $\mathbb{R}^d$, let $E_\epsilon=\cup_{i=1}^m\,x_i+Q_\epsilon$, where $Q_\epsilon=\{x\in \mathbb{R}^d,\,\,|x_i|\le \epsilon/2, \, i=1,...,d\}$ and let $\hat f$ denote the Fourier transform of…

Functional Analysis · Mathematics 2016-05-03 Jean-Pierre Gabardo , Chun-Kit Lai

Working on doubling metric spaces, we construct generalised dyadic cubes adapting ultrametric structure. If the space is complete, then the existence of such cubes and the mass distribution principle lead into a simple proof for the…

Classical Analysis and ODEs · Mathematics 2017-02-03 Antti Käenmäki , Tapio Rajala , Ville Suomala

We consider a collection of fully coupled weakly interacting diffusion processes moving in a two-scale environment. We study the moderate deviations principle of the empirical distribution of the particles' positions in the combined limit…

Probability · Mathematics 2023-07-17 Zachary Bezemek , Konstantinos Spiliopoulos

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

We present a simple model in dimension $d\geq 2$ for slowing particles in random media, where point particles move in straight lines among and inside spherical identical obstacles with Poisson distributed centres. When crossing an obstacle,…

Mathematical Physics · Physics 2025-05-16 François Golse , Valeria Ricci , Ana Jacinta Soares

Consider the Abelian sandpile measure on $\mathbb{Z}^d$, $d \ge 2$, obtained as the $L \to \infty$ limit of the stationary distribution of the sandpile on $[-L,L]^d \cap \mathbb{Z}^d$. When adding a grain of sand at the origin, some region,…

Probability · Mathematics 2017-09-29 Sandeep Bhupatiraju , Jack Hanson , Antal A. Járai

We investigate the fractional diffusion approximation of a kinetic equation in the upper-half plane with diffusive reflection conditions at the boundary. In an appropriate singular limit corresponding to small Knudsen number and long time…

Analysis of PDEs · Mathematics 2019-09-04 Ludovic Cesbron , Antoine Mellet , Marjolaine Puel

A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…

Combinatorics · Mathematics 2025-10-14 Antoine Deza , Zhongyuan Liu , Lionel Pournin

Let $C_1, \dots, C_n$ denote the $1/n-$neighborhood of $n$ great circles on $\mathbb{S}^2$. We are interested in how much these areas have to overlap and prove the sharp bounds $$ \sum_{i, j = 1 \atop i \neq j}^{n}{|C_i \cap C_j|^s}…

Metric Geometry · Mathematics 2016-07-14 Stefan Steinerberger

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

Computational Geometry · Computer Science 2019-05-08 Mahdi Imanparast , Seyed Naser Hashemi , Ali Mohades

We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…

Probability · Mathematics 2019-05-28 Jens Grygierek

In this note, we assess the accuracy of CLT-based approximations for the volume of intersection of the $d$-dimensional cube $[-1,1]^d$ and an $L_q$-ball centred at the origin; this is clearly equivalent to approximating the distribution of…

Statistics Theory · Mathematics 2023-12-12 Zoe Shapcott

We compute explicit upper bounds on the distance between the law of a multivariate Gaussian distribution and the joint law of wavelets/needlets coefficients based on a homogeneous spherical Poisson field. In particular, we develop some…

Probability · Mathematics 2015-04-27 Claudio Durastanti , Domenico Marinucci , Giovanni Peccati

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…

Combinatorics · Mathematics 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz
‹ Prev 1 8 9 10 Next ›