Related papers: Irregularities of distributions and extremal sets …

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

We investigate the expected star discrepancy under a newly designed class of convex equivolume partition models. The main contributions are two-fold. First, we establish a strong partition principle for the star discrepancy, showing that…

A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: given $k \leq d/2$, does the random $d$-regular graph have a $k$-star…

For every unit vector $\sigma\in\Sigma_{d-1}$ and every $r\ge0$, let % % \begin{displaymath} P_{\sigma,r}=[-1,1]^d\cap\{t\in\Rr^d:t\cdot\sigma\le r\} \end{displaymath} % % denote the intersection of the cube $[-1,1]^d$ with a half-space…

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…

We study the expected star discrepancy under a newly designed class of non-equal volume partitions. The main contributions are twofold. First, we establish a strong partition principle for the star discrepancy, showing that our newly…

The paper is devoted to the study of extremal points of $\mathcal{C}$, the family of all two-variate coherent distributions on $[0,1]^2$. It is well-known that the set $\mathcal{C}$ is convex and weak$^*$ compact, and all extreme points of…

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…

Building upon the exact methods presented in our earlier work [J. Complexity, 2022], we introduce a heuristic approach for the star discrepancy subset selection problem. The heuristic gradually improves the current-best subset by replacing…

We show that for every large enough integer $N$, there exists an $N$-point subset of $L_1$ such that for every $D>1$, embedding it into $\ell_1^d$ with distortion $D$ requires dimension $d$ at least $N^{\Omega(1/D^2)}$, and that for every…

We provide an algorithm to approximate a finitely supported discrete measure $\mu$ by a measure $\nu_{N}$ corresponding to a set of $N$ points so that the total variation between $\mu$ and $\nu_N$ has an upper bound. As a consequence if…

A celebrated result of Beck shows that for any set of $N$ points on $\mathbb{S}^d$ there always exists a spherical cap $B \subset \mathbb{S}^d$ such that number of points in the cap deviates from the expected value $\sigma(B) \cdot N$ by at…

We prove that in all dimensions n at least 3, for every integer N there exists a distribution of points of cardinality $ N$, for which the associated discrepancy function D_N satisfies the estimate an estimate, of sharp growth rate in N, in…

A $k$-star decomposition of a graph is a partition of its edges into $k$-stars (i.e., $k$ edges with a common vertex). The paper studies the following problem: for what values of $k>d/2$ does the random $d$-regular graph have a $k$-star…

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

We study points in cut-and-project sets which are visible from the origin, continuing a direction of inquiry initiated in [6,14] where the asymptotic density of visible points was investigated. We establish an error bound for the density of…

This paper characterizes singularities with Mather minimal log discrepancies in the highest unit interval, i.e., the interval between $d-1$ and $d$, where $d$ is the dimension of the scheme. The class of these singularities coincides with…

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

For a set of distances D={d_1,...,d_k} a set A is called D-avoiding if no pair of points of A is at distance d_i for some i. We show that the density of A is exponentially small in k provided the ratios d_1/d_2, d_2/d_3, ..., d_{k-1}/d_k…

A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…