English
Related papers

Related papers: An upper bound on the minimal dispersion

200 papers

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Combinatorics · Mathematics 2026-05-19 Samuel Korsky

We study first-passage percolation on $\mathbb Z^d$, $d\ge 2$, with independent weights whose common distribution is compactly supported in $(0,\infty)$ with a uniformly-positive density. Given $\epsilon>0$ and $v\in\mathbb Z^d$, which…

Probability · Mathematics 2023-10-16 Barbara Dembin , Dor Elboim , Ron Peled

A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…

Number Theory · Mathematics 2012-05-22 Damien Roy

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

We present a technique for deriving lower bounds for incidences with hypersurfaces in ${\mathbb R}^d$ with $d\ge 4$. These bounds apply to a large variety of hypersurfaces, such as hyperplanes, hyperspheres, paraboloids, and hypersurfaces…

Combinatorics · Mathematics 2016-10-05 Adam Sheffer

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

Probability · Mathematics 2024-04-25 Umberto De Ambroggio , Tamás Makai , Konstantinos Panagiotou , Annika Steibel

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for…

Number Theory · Mathematics 2026-05-05 Wouter van Doorn , Pietro Monticone , Quanyu Tang

Let $X_1,X_2, \ldots $ and $Y_1, Y_2, \ldots$ be i.i.d. random uniform points in a bounded domain $A \subset \mathbb{R}^2$ with smooth or polygonal boundary. Given $n,m,k \in \mathbb{N}$, define the {\em two-sample $k$-coverage threshold}…

Probability · Mathematics 2025-01-16 Frankie Higgs , Mathew D. Penrose , Xiaochuan Yang

Let $p\geq3$ be a large prime and let $n(p)\geq2$ denotes the least quadratic nonresidue modulo $p$. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound $n(p)\ll…

General Mathematics · Mathematics 2025-10-10 N. A. Carella

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

Number Theory · Mathematics 2013-08-26 Christoph Aistleitner , Josef Dick

It is proved that the projection constants of two- and three-dimensional spaces are bounded by $4/3$ and $(1+\sqrt 5)/2$, respectively. These bounds are attained precisely by the spaces whose unit balls are the regular hexagon and…

Functional Analysis · Mathematics 2016-09-06 Hermann König , Nicole Tomczak-Jaegermann

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…

Data Structures and Algorithms · Computer Science 2010-12-13 Friedrich Eisenbrand , Nicolai Hähnle , Martin Niemeier

We consider a system of annihilating particles where particles start from the points of a Poisson process on the line, move at constant i.i.d. speeds symmetrically distributed in {-1,0,+1} and annihilate upon collision. We prove that…

Probability · Mathematics 2018-09-03 Vladas Sidoravicius , Laurent Tournier

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. For any $\lambda>0$ we consider the percolation…

Probability · Mathematics 2019-07-10 David Dereudre , Mathew D. Penrose

In this paper, we considier the limiting distribution of the maximum interpoint Euclidean distance $M_n=\max _{1 \leq i<j \leq n}\left\|\boldsymbol{X}_i-\boldsymbol{X}_j\right\|$, where $\boldsymbol{X}_1, \boldsymbol{X}_2, \ldots,…

Probability · Mathematics 2023-12-19 Guowei Yan , Long Feng

Upper bounds for the $L_p$-discrepancies of point distributions in compact metric measure spaces for $0<p\le\infty$ have been established in the paper [6] by Brandolini, Chen, Colzani, Gigante and Travaglini. In the present paper we show…

Metric Geometry · Mathematics 2018-05-01 M. M. Skriganov

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Metric Geometry · Mathematics 2015-06-12 Andreas Alpers , David G. Larman

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

Computational Geometry · Computer Science 2022-08-15 Stephane Durocher , J. Mark Keil , Debajyoti Mondal