English
Related papers

Related papers: A Lower Bound for the Discrepancy of a Random Poin…

200 papers

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

Combinatorics · Mathematics 2022-10-18 Henry L. Fleischmann , Steven J. Miller , Eyvindur A. Palsson , Ethan Pesikoff , Charles Wolf

For a probability measure $\mu$ on $[0,1]$ without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is $\frac{1}{2N}$ as has been proven relatively recently. However, if…

Number Theory · Mathematics 2022-02-04 Christian Weiß

It is known that there is a constant $c > 0$ such that for every sequence $x_1, x_2, \ldots$ in $[0,1)$ we have for the star discrepancy $D_N^*$ of the first $N$ elements of the sequence that $N D_N^* \ge c \cdot \log N$ holds for…

Number Theory · Mathematics 2014-07-09 Gerhard Larcher

The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…

Combinatorics · Mathematics 2019-06-13 Joel Larsson , Klas Markström

Let $\varphi_{n,K}$ denote the largest angle in all the triangles with vertices among the $n$ points selected at random in a compact convex subset $K$ of $\mathbb{R}^d$ with nonempty interior, where $d\ge2$. It is shown that the…

Probability · Mathematics 2016-08-29 Iosif Pinelis

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…

Machine Learning · Statistics 2026-03-10 Xiaoda Xu

We obtain the minimax rate for a mean location model with a bounded star-shaped set $K \subseteq \mathbb{R}^n$ constraint on the mean, in an adversarially corrupted data setting with Gaussian noise. We assume an unknown fraction $\epsilon…

Statistics Theory · Mathematics 2026-03-06 Akshay Prasadan , Matey Neykov

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…

Data Structures and Algorithms · Computer Science 2018-10-09 Nikhil Bansal , Raghu Meka

A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…

Number Theory · Mathematics 2015-10-26 Yufei Zhao

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

Metric Geometry · Mathematics 2009-01-22 Károly J. Böröczky , Rolf Schneider

We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in $S_n$ is $\frac{n(n-1)}4$. For each $n\in\mathbb{N}$, and each $k\in\{0,1,\cdots,…

Probability · Mathematics 2025-05-06 Ross G. Pinsky

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…

Classical Analysis and ODEs · Mathematics 2016-04-21 Tuomas Orponen

We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…

Probability · Mathematics 2024-12-19 Victor Dubach

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

The variance conjecture in Asymptotic Convex Geometry stipulates that the Euclidean norm of a random vector uniformly distributed in a (properly normalised) high-dimensional convex body $K\subset {\mathbb R}^n$ satisfies a Poincar\'e-type…

Functional Analysis · Mathematics 2018-05-09 Beatrice-Helen Vritsiou

Let N > n, and denote by K the convex hull of N independent standard gaussian random vectors in an n-dimensional Euclidean space. We prove that with high probability, the isotropic constant of K is bounded by a universal constant. Thus we…

Metric Geometry · Mathematics 2007-05-23 Bo'az Klartag , Gady Kozma

We prove that the uniform probability measure $\mu$ on every $(n-k)$-dimensional projection of the $n$-dimensional unit cube verifies the variance conjecture with an absolute constant $C$ $$\textrm{Var}_\mu|x|^2\leq C \sup_{\theta\in…

Functional Analysis · Mathematics 2017-03-30 David Alonso-Gutiérrez , Julio Bernués

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

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…

Classical Analysis and ODEs · Mathematics 2023-09-13 Dmitriy Bilyk , Michelle Mastrianni , Stefan Steinerberger

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball