English
Related papers

Related papers: Low discrepancy sequences failing Poissonian pair …

200 papers

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Number Theory · Mathematics 2018-05-30 Zeév Rudnick

Let $\left(a_{n}\right)_{n}$ be a strictly increasing sequence of positive integers, denote by $A_{N}=\left\{ a_{n}:\,n\leq N\right\} $ its truncations, and let $\alpha\in\left[0,1\right]$. We prove that if the additive energy…

Number Theory · Mathematics 2017-08-30 Thomas Lachmann , Niclas Technau

The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…

Number Theory · Mathematics 2015-03-26 Maria Rita Iacò , Volker Ziegler

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

Number Theory · Mathematics 2016-12-19 Christoph Aistleitner , Thomas Lachmann , Florian Pausinger

Let $m\geq 3$, we prove that $(\alpha n^\theta \mod 1)_{n>0}$ has Poissonian $m$-point correlation for all $\alpha>0$, provided $\theta<\theta_m$, where $\theta_m$ is an explicit bound which goes to $0$ as $m$ increases. This work builds on…

Number Theory · Mathematics 2021-12-23 Christopher Lutsko , Niclas Technau

For fixed $\alpha \in [0,1]$, consider the set $S_{\alpha,N}$ of dilated squares $\alpha, 4\alpha, 9\alpha, \dots, N^2\alpha \, $ modulo $1$. Rudnick and Sarnak conjectured that for Lebesgue almost all such $\alpha$ the gap-distribution of…

Number Theory · Mathematics 2021-04-22 Niclas Technau , Aled Walker

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n\geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n \geq1}$ is uniformly distributed modulo one for…

Number Theory · Mathematics 2015-07-24 Christoph Aistleitner , Gerhard Larcher

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $\nu(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $\nu(p)$…

Number Theory · Mathematics 2019-02-20 Manfred G. Madritsch , Robert F. Tichy

We exhaustively classify the Lie reductions of the real dispersionless Nizhnik equation to partial differential equations in two independent variables and to ordinary differential equations. Lie and point symmetries of reduced equations are…

Mathematical Physics · Physics 2024-09-19 Oleksandra O. Vinnichenko , Vyacheslav M. Boyko , Roman O. Popovych

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Computational Complexity · Computer Science 2017-11-29 Makrand Sinha

Estimates based on 2x2 tables of frequencies are widely used in statistical applications. However, in many cases these tables are incomplete in the sense that the data required to compute the frequencies for a subset of the cells defining…

Statistics Theory · Mathematics 2018-08-31 Li-Chun Zhang , Raymond L. Chambers

We study intermediate-scale statistics for the fractional parts of the sequence $(\alpha a_n)_{n=1}^{\infty}$, where $(a_n)_{n=1}^{\infty}$ is a positive, real-valued lacunary sequence, and $\alpha\in\mathbb{R}$. In particular, we consider…

Number Theory · Mathematics 2023-08-16 Nadav Yesha

In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…

Number Theory · Mathematics 2025-11-04 Armin Straub

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

Classical Analysis and ODEs · Mathematics 2018-05-29 Paolo Leonetti

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

Probability · Mathematics 2020-11-02 Tuan Tran

We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…

Data Structures and Algorithms · Computer Science 2021-10-22 Samuel B. Hopkins , Prasad Raghavendra , Abhishek Shetty

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

Number Theory · Mathematics 2019-02-20 Jens Marklof , Nadav Yesha

This paper adresses the question whether the $LS$-sequences constructed by Carbone yield indeed a new family of low discrepancy sequences. While it is well known that the case $S=0$ corresponds to van der Corput sequences, we prove here…

Number Theory · Mathematics 2017-12-05 Christian Weiß

We consider sequences of the form $\left(a_{n} \alpha\right)_{n}$ mod 1, where $\alpha\in\left[0,1\right]$ and where $\left(a_{n}\right)_{n}$ is a strictly increasing sequence of positive integers. If the asymptotic distribution of the pair…

Number Theory · Mathematics 2019-07-24 Christoph Aistleitner , Thomas Lachmann , Niclas Technau

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