中文
相关论文

相关论文: Probabilistic Star Discrepancy Bounds for Lacunary…

200 篇论文

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

概率论 · 数学 2025-04-21 Adrian Beker

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…

数论 · 数学 2013-06-10 Gagik Amirkhanyan , Dmitriy Bilyk , Michael T Lacey

The irregularities of a distribution of $N$ points in the unit interval are often measured with various notions of discrepancy. The discrepancy function can be defined with respect to intervals of the form $[0,t)\subset [0,1)$ or arbitrary…

数论 · 数学 2019-11-27 Ralph Kritzinger , Markus Passenbrunner

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…

离散数学 · 计算机科学 2014-07-10 Ronan Le Bras , Carla P. Gomes , Bart Selman

Mordechay B. Levin has constructed a number $\lambda$ which is normal in base 2, and such that the sequence $(\left\{2^n \lambda\right\})_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O}…

数论 · 数学 2022-11-09 Roswitha Hofer , Gerhard Larcher

For r \ge 2, let X be the number of r-armed stars K_{1,r} in the binomial random graph G_{n,p}. We study the upper tail \Pr(X \ge (1+\epsilon)\E X), and establish exponential bounds which are best possible up to constant factors in the…

概率论 · 数学 2021-04-06 Matas Šileikis , Lutz Warnke

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

We consider the problem $(\mathrm{P})$ of fitting $n$ standard Gaussian random vectors in $\mathbb{R}^d$ to the boundary of a centered ellipsoid, as $n, d \to \infty$. This problem is conjectured to have a sharp feasibility transition: for…

We prove that for $c>0$ a sufficiently small universal constant that a random set of $c d^2/\log^4(d)$ independent Gaussian random points in $\mathbb{R}^d$ lie on a common ellipsoid with high probability. This nearly establishes a…

概率论 · 数学 2022-12-22 Daniel M. Kane , Ilias Diakonikolas

The aims of this paper are twofold. First, it discusses the Littlewood conjecture and its variants with respect to uniformly distributed sequences. The second aim is to determine the exact order of the discrepancy of the van der…

数论 · 数学 2025-09-01 Roswitha Hofer

The determinant lower bound of Lovasz, Spencer, and Vesztergombi [European Journal of Combinatorics, 1986] is a powerful general way to prove lower bounds on the hereditary discrepancy of a set system. In their paper, Lovasz, Spencer, and…

组合数学 · 数学 2024-01-18 Lily Li , Aleksandar Nikolov

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

Given a closed Riemann surface $\Sigma$ equipped with a volume form $\omega$, we construct a natural probability measure on the space $\mathcal{M}_d(\Sigma)$ of degree $d$ branched coverings from $\Sigma$ to the Riemann sphere…

代数几何 · 数学 2020-04-07 Michele Ancona

Radio observations of neutron star binary pulsar systems have constrained strongly the masses of eight neutron stars. Assuming neutron star masses are uniformly distributed between lower and upper bounds $m_l$ and $m_u$, the observations…

天体物理学 · 物理学 2009-01-23 L. S. Finn

Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with…

A star of n (n greater than or equal to 2) line segments (needles) of equal length with common endpoint and constant angular spacing is randomly placed onto a lattice which is the union of two families of equidistant lines in the plane with…

概率论 · 数学 2012-09-25 Uwe Bäsel

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_d > 0$ such that whenever $X_1,..., X_{d+1}$ are $n$-element subsets of $\mathbb{R}^d$, then we…

度量几何 · 数学 2015-10-20 Roman Karasev , Jan Kynčl , Pavel Paták , Zuzana Patáková , Martin Tancer

The weighted star-discrepancy has been introduced by Sloan and Wo{\'z}niakowski to reflect the fact that in multidimensional integration problems some coordinates of a function may be more important than others. It provides upper bounds for…

数值分析 · 数学 2013-12-06 Christoph Aistleitner

We give sufficient conditions for the number rigidity of a translation invariant or periodic point process on $\mathbb{R}^d$, where $d=1,2$. That is, the probability distribution of the number of particles in a bounded domain $\Lambda…

概率论 · 数学 2016-11-23 Subhro Ghosh , Joel Lebowitz

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

组合数学 · 数学 2025-10-03 Josef Greilhuber , Carl Schildkraut , Jonathan Tidor