相关论文: Difference sets and the metric theory of small gap…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. The metric theory of minimal gaps for the sequence $\{\alpha a_n \text{ mod }1, 1\leq n \leq N\}$ as $N \to \infty$ was initiated by Rudnick, who established that the…

In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…

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…

We study the minimal gap statistic for sequences of the form $\left( \alpha x_n \right)_{n = 1}^{\infty}$ where $\left( x_n \right)_{n = 1}^{\infty}$ is a sequence of real numbers, and its connection to the additive energy of $\left( x_n…

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

The Duffin-Schaeffer conjecture is a central open problem in metric number theory. Let $\psi~\mathbb{N} \mapsto \mathbb{R}$ be a non-negative function, and set $\mathcal{E}_n :=\bigcup \left( \frac{a - \psi(n)}{n},\frac{a+\psi(n)}{n}…

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

This paper deals with the distribution of $\alpha \zeta^{n} \bmod 1$, where $\alpha\neq 0,\zeta>1$ are fixed real numbers and $n$ runs through the positive integers. Denote by $\Vert.\Vert$ the distance to the nearest integer. We…

In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V…

The fundamental gap conjecture proved by Andrews and Clutterbuck in 2011 provides the sharp lower bound for the difference between the first two Dirichlet Laplacian eigenvalues in terms of the diameter of a convex set in $\mathbb{R}^N$. The…

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

Let $(a_n)_{n \in \mathbb{N}}$ be a Hadamard lacunary sequence. We give upper bounds for the maximal gap of the set of dilates $\{a_n \alpha\}_{n \leq N}$ modulo 1, in terms of $N$. For any lacunary sequence $(a_n)_{n \in \mathbb{N}}$ we…

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…

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…

A well-known theorem of Sperner describes the largest collections of subsets of an $n$-element set none of which contains another set from the collection. Generalising this result, Erd\H{o}s characterised the largest families of subsets of…