中文
相关论文

相关论文: An Upper Bound of the Minimal Dispersion via Delta…

200 篇论文

We consider the volume of the largest axis-parallel box in the $d$-dimensional torus that contains no point of a given point set $\mathcal{P}_n$ with $n$ elements. We prove that, for all natural numbers $d, n$ and every point set…

计算复杂性 · 计算机科学 2019-08-15 Mario Ullrich

In this note we present a construction which improves the best known bound on the minimal dispersion of large volume boxes in the unit cube. Let $d>1$. The dispersion of $T \subset [0,1]^d$ is defined as the supremum of the volume taken…

度量几何 · 数学 2022-01-13 Kurt S. MacKay

We show that, for every set of $n$ points in the $d$-dimensional unit cube, there is an empty axis-parallel box of volume at least $\Omega(d/n)$ as $n\to\infty$ and $d$ is fixed. In the opposite direction, we give a construction without an…

组合数学 · 数学 2021-02-26 Boris Bukh , Ting-Wei Chao

We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…

组合数学 · 数学 2016-10-17 Adrian Dumitrescu , Minghui Jiang

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

组合数学 · 数学 2025-09-09 Matěj Trödler , Jan Volec , Jan Vybíral

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…

计算几何 · 计算机科学 2017-06-20 Christoph Aistleitner , Aicke Hinrichs , Daniel Rudolf

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

经典分析与常微分方程 · 数学 2019-08-15 Mario Ullrich , Jan Vybíral

The dispersion of a point set in $[0,1]^d$ is the volume of the largest axis parallel box inside the unit cube that does not intersect with the point set. We study the expected dispersion with respect to a random set of $n$ points…

概率论 · 数学 2020-03-27 Aicke Hinrichs , David Krieg , Robert J. Kunsch , Daniel Rudolf

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

计算几何 · 计算机科学 2014-02-04 Adrian Dumitrescu , Sariel Har-Peled , Csaba D. Tóth

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

组合数学 · 数学 2025-07-16 Boris Bukh , Aleksandre Saatashvili

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

计算几何 · 计算机科学 2017-11-16 Jakub Sosnovec

Let \((a_n)_{n \in \mathbb{N}}\) be a lacunary sequence of integers satisfying the Hadamard gap condition. For any fixed dimension $d \geq 1$, we establish asymptotic upper bounds for the maximal gap in the set of dilates…

数论 · 数学 2025-08-26 Eduard Stefanescu

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…

计算几何 · 计算机科学 2009-11-23 Adrian Dumitrescu , Minghui Jiang

In this manuscript we introduce and study an extended version of the minimal dispersion of point sets, which has recently attracted considerable attention. Given a set $\mathscr P_n=\{x_1,\dots,x_n\}\subset [0,1]^d$ and…

数值分析 · 数学 2019-08-15 Aicke Hinrichs , Joscha Prochno , Mario Ullrich , Jan Vybiral

We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper density zero. We are interested in how…

度量几何 · 数学 2015-03-20 Sascha Kurz , Valery Mishkin

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

组合数学 · 数学 2025-01-30 Boris Bukh , Zichao Dong

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

度量几何 · 数学 2025-12-10 Alexander E. Litvak , Mathias Sonnleitner , Tomasz Szczepanski

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

组合数学 · 数学 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth

In many cosmological models, including the $\Lambda$CDM concordance model, there exist a theoretical upper bounds on the size of collapsing structures. The most common formulations in the literature refer to a turnaround radius in spherical…

广义相对论与量子宇宙学 · 物理学 2022-05-11 Jan J. Ostrowski , Ismael Delgado Gaspar

We study the sizes of delta-additive sets of unit vectors in a d-dimensional normed space: the sum of any two vectors has norm at most delta. One-additive sets originate in finding upper bounds of vertex degrees of Steiner Minimum Trees in…

度量几何 · 数学 2010-06-08 Konrad J. Swanepoel
‹ 上一页 1 2 3 10 下一页 ›