English
Related papers

Related papers: A note on minimal dispersion of point sets in the …

200 papers

We derive fundamental asymptotic results for the expected covering radius $\rho(X_N)$ for $N$ points that are randomly and independently distributed with respect to surface measure on a sphere as well as on a class of smooth manifolds. For…

Probability · Mathematics 2015-04-14 A. Reznikov , E. B. Saff

We prove that the the discrepancy of arithmetic progressions in the $d$-dimensional grid $\{1, \dots, N\}^d$ is within a constant factor depending only on $d$ of $N^{\frac{d}{2d+2}}$. This extends the case $d=1$, which is a celebrated…

Combinatorics · Mathematics 2021-11-01 Jacob Fox , Max Wenqiang Xu , Yunkun Zhou

The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest empty box is of asymptotic order $1/n$ for $n\to\infty$ and…

Computational Geometry · Computer Science 2017-06-20 Christoph Aistleitner , Aicke Hinrichs , Daniel Rudolf

The measurement of dispersion is one of the most fundamental and ubiquitous statistical concepts, in both applied and theoretical contexts. For dispersion measures, such as the standard deviation, to effectively capture the variability of a…

Methodology · Statistics 2025-07-09 Andreas Eberl , Bernhard Klar

We study droplet-impact problems in a three-dimensional cylindrical or equivalent two-dimensional Cartesian geometry. Such structures do have an approximate experimental realization, and they are often simulated a test-bed for computational…

Fluid Dynamics · Physics 2023-07-25 Lennon Ó Náraigh , Juan Mairal

In this paper we fill in a fundamental gap in the extremal bootstrap percolation literature, by providing the first proof of the fact that for all $d \geq 1$, the size of the smallest percolating sets in $d$-neighbour bootstrap percolation…

Combinatorics · Mathematics 2019-07-04 Michał Przykucki , Thomas Shelton

We prove anti-concentration bounds for the inner product of two independent random vectors, and use these bounds to prove lower bounds in communication complexity. We show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot…

Probability · Mathematics 2022-01-06 Anup Rao , Amir Yehudayoff

For integers $d \geq 2$ and $k \geq d+1$, a $k$-hole in a set $S$ of points in general position in $\mathbb{R}^d$ is a $k$-tuple of points from $S$ in convex position such that the interior of their convex hull does not contain any point…

Combinatorics · Mathematics 2022-02-08 Martin Balko , Manfred Scheucher , Pavel Valtr

We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…

Probability · Mathematics 2011-11-21 Amine Asselah , Alexandre Gaudilliere

In this paper, we investigate the problem of separating a set $X$ of points in $\mathbb{R}^{2}$ with an arrangement of $K$ lines such that each cell contains an asymptotically equal number of points (up to a constant ratio). We consider a…

Combinatorics · Mathematics 2017-01-18 Nikhil Marda

Let $L \subset {\Bbb R}^3$ be the union of unit balls, whose centres lie on the $z$-axis, and are equidistant with distance $2d \in [2, 2\sqrt{2}]$. Then a packing of unit balls in ${\Bbb R}^3$ consisting of translates of $L$ has a density…

Metric Geometry · Mathematics 2017-06-19 K. Böröczky , A. Heppes , E. Makai

The aim of this paper is threefold. We first prove that, on $\mathrm{RCD}(K,N)$ spaces, the boundary measure of any set with finite perimeter is concentrated on the $n$-regular set $\mathcal{R}_n$, where $n\le N$ is the essential dimension…

Metric Geometry · Mathematics 2021-09-28 Elia Bruè , Enrico Pasqualetto , Daniele Semola

In a projective plane $\Pi_{q}$ (not necessarily Desarguesian) of order $q$, a point subset $\mathcal{S}$ is saturating (or dense) if any point of $\Pi_{q}\setminus \mathcal{S}$ is collinear with two points in $\mathcal{S}$. Modifying an…

In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of…

Numerical Analysis · Mathematics 2014-02-17 Christoph Aistleitner , Johann Brauchart , Josef Dick

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

Combinatorics · Mathematics 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…

Combinatorics · Mathematics 2015-04-10 Aleksandar Nikolov , Kunal Talwar

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Maria Axenovich , John Goldwasser

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

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser
‹ Prev 1 8 9 10 Next ›