We derive an explicit formula for the N-point correlation $F_N(s)$ of the van der Corput sequence in base $2$ for all $N \in \mathbb {N}$ and $s \geq 0$. The formula can be evaluated without explicit knowledge about the elements of the van der Corput sequence. This constitutes the first example of an exact closed-form expression of $F_N(s)$ for all $N \in \mathbb {N}$ and all $s \geq 0$ which does not require explicit knowledge about the involved sequence. Moreover, it can be immediately read off that $\lim _{N \to \infty } F_N(s)$ exists only for $0 \leq s \leq 1/2$.

Let $x\in [0,1)$ be an irrational number and let $x=[a_{1}(x),a_{2}(x),\ldots ]$ be its continued fraction expansion with partial quotients $\{a_{n}(x): n\geq 1\}$ . Given a natural number m and a vector $(x_{1},\ldots ,x_{m})\in [0,1)^{m},$ we derive the asymptotic behaviour of the shortest distance function

$$ \begin{align*} M_{n,m}(x_{1},\ldots,x_{m})=\max\{k\in \mathbb{N}: a_{i+j}(x_{1})=\cdots= a_{i+j}(x_{m}) \ \text{for}~ j=1,\ldots,k \mbox{ and some } i \mbox{ with } 0\leq i \leq n-k\}, \end{align*} $$

which represents the run-length of the longest block of the same symbol among the first n partial quotients of $(x_{1},\ldots ,x_{m}).$ We also calculate the Hausdorff dimension of the level sets and exceptional sets arising from the shortest distance function.

We study fluctuations of the error term for the number of integer lattice points lying inside a three-dimensional Cygan–Korányi ball of large radius. We prove that the error term, suitably normalized, has a limiting value distribution which is absolutely continuous, and we provide estimates for the decay rate of the corresponding density on the real line. In addition, we establish the existence of all moments for the normalized error term, and we prove that these are given by the moments of the corresponding density.

In this paper, we reduce the logarithmic Sarnak conjecture to the $\{0,1\}$-symbolic systems with polynomial mean complexity. By showing that the logarithmic Sarnak conjecture holds for any topologically dynamical system with sublinear complexity, we provide a variant of the $1$-Fourier uniformity conjecture, where the frequencies are restricted to any subset of $[0,1]$ with packing dimension less than one.

The main objective of this paper is to answer the questions posed by Robinson and Sadowski [22, p. 505, Commun. Math. Phys., 2010] for the Navier–Stokes equations. Firstly, we prove that the upper box dimension of the potential singular points set $\mathcal {S}$ of suitable weak solution $u$ belonging to $L^{q}(0,T;L^{p}(\mathbb {R}^{3}))$ for $1\leq \frac {2}{q}+\frac {3}{p}\leq \frac 32$ with $2\leq q<\infty$ and $2< p<\infty$ is at most $\max \{p,q\}(\frac {2}{q}+\frac {3}{p}-1)$ in this system. Secondly, it is shown that $1-2s$ dimension Hausdorff measure of potential singular points set of suitable weak solutions satisfying $u\in L^{2}(0,T;\dot {H}^{s+1}(\mathbb {R}^{3}))$ for $0\leq s\leq \frac 12$ is zero, whose proof relies on Caffarelli–Silvestre's extension. Inspired by Barker–Wang's recent work [1], this further allows us to discuss the Hausdorff dimension of potential singular points set of suitable weak solutions if the gradient of the velocity is under some supercritical regularity.

We study intermediate-scale statistics for the fractional parts of the sequence $\left(\alpha a_{n}\right)_{n=1}^{\infty}$, where $\left(a_{n}\right)_{n=1}^{\infty}$ is a positive, real-valued lacunary sequence, and $\alpha\in\mathbb{R}$. In particular, we consider the number of elements $S_{N}\!\left(L,\alpha\right)$ in a random interval of length $L/N$, where $L=O\!\left(N^{1-\epsilon}\right)$, and show that its variance (the number variance) is asymptotic to L with high probability w.r.t. $\alpha$, which is in agreement with the statistics of uniform i.i.d. random points in the unit interval. In addition, we show that the same asymptotic holds almost surely in $\alpha\in\mathbb{R}$ when $L=O\!\left(N^{1/2-\epsilon}\right)$. For slowly growing L, we further prove a central limit theorem for $S_{N}\!\left(L,\alpha\right)$ which holds for almost all $\alpha\in\mathbb{R}$.

In this paper, we study the Hausdorff dimension of sets defined by almost convergent binary expansion sequences. More precisely, the Hausdorff dimension of the following set

\begin{align*} \bigg\{x\in[0,1)\;:\;\frac{1}{n}\sum_{k=a}^{a+n-1}x_{k}\longrightarrow\alpha\textrm{ uniformly in }a\in\mathbb{N}\textrm{ as }n\rightarrow\infty\bigg\} \end{align*}

$ \alpha\in[0,1] $

$ \alpha $

Erdős considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a generalisation stating that the gaps between primes p for which there is no $\mathbb{Q}_p$ -point on a random variety are Poisson distributed.

Let $\psi : \mathbb {N} \to [0,1/2]$ be given. The Duffin–Schaeffer conjecture, recently resolved by Koukoulopoulos and Maynard, asserts that for almost all reals $\alpha$ there are infinitely many coprime solutions $(p,q)$ to the inequality $|\alpha - p/q| < \psi (q)/q$, provided that the series $\sum _{q=1}^\infty \varphi (q) \psi (q) / q$ is divergent. In the present paper, we establish a quantitative version of this result, by showing that for almost all $\alpha$ the number of coprime solutions $(p,q)$, subject to $q \leq Q$, is of asymptotic order $\sum _{q=1}^Q 2 \varphi (q) \psi (q) / q$. The proof relies on the method of GCD graphs as invented by Koukoulopoulos and Maynard, together with a refined overlap estimate from sieve theory, and number-theoretic input on the ‘anatomy of integers’. The key phenomenon is that the system of approximation sets exhibits ‘asymptotic independence on average’ as the total mass of the set system increases.

We show, from a topological viewpoint, that most numbers are not normal in a strong sense. More precisely, the set of numbers $x \in (0,1]$ with the following property is comeager: for all integers $b\ge 2$ and $k\ge 1$ , the sequence of vectors made by the frequencies of all possibile strings of length k in the b-adic representation of x has a maximal subset of accumulation points, and each of them is the limit of a subsequence with an index set of nonzero asymptotic density. This extends and provides a streamlined proof of the main result given by Olsen (2004) in this Journal. We provide analogues in the context of analytic P-ideals and regular matrices.

Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta (n^{1/4})$. We study the analogous problem in the $\mathbb {Z}_n$ setting. We asymptotically determine the logarithm of the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for all positive integer $n$. We further determine up to a constant factor the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for many $n$. For example, if $n=p^k$ is a prime power, then the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ is $\Theta (n^{1/3+r_k/(6k)})$, where $r_k \in \{0,1,2\}$ is the remainder when $k$ is divided by $3$. This solves a problem of Hebbinghaus and Srivastav.

We show that for a Salem number $\beta $ of degree d, there exists a positive constant $c(d)$ where $\beta ^m$ is a Parry number for integers m of natural density $\ge c(d)$. Further, we show $c(6)>1/2$ and discuss a relation to the discretized rotation in dimension $4$.

Let $r=[a_1(r), a_2(r),\ldots ]$ be the continued fraction expansion of a real number $r\in \mathbb R$ . The growth properties of the products of consecutive partial quotients are tied up with the set admitting improvements to Dirichlet’s theorem. Let $(t_1, \ldots , t_m)\in \mathbb R_+^m$ , and let $\Psi :\mathbb {N}\rightarrow (1,\infty )$ be a function such that $\Psi (n)\to \infty $ as $n\to \infty $ . We calculate the Hausdorff dimension of the set of all $ (x, y)\in [0,1)^2$ such that

$$ \begin{align*} \max\left\{\prod_{i=1}^ma_{n+i}^{t_i}(x), \prod_{i=1}^ma_{n+i}^{t_i}(y)\right\} \geq \Psi(n) \end{align*} $$

$n\geq 1$

Dirichlet’s theorem, including the uniform setting and asymptotic setting, is one of the most fundamental results in Diophantine approximation. The improvement of the asymptotic setting leads to the well-approximable set (in words of continued fractions)

$$ \begin{align*} \mathcal{K}(\Phi):=\{x:a_{n+1}(x)\ge\Phi(q_{n}(x))\ \textrm{for infinitely many }n\in \mathbb{N}\}; \end{align*} $$

$$ \begin{align*} \mathcal{G}(\Phi):=\{x:a_{n}(x)a_{n+1}(x)\ge\Phi(q_{n}(x))\ \textrm{for infinitely many }n\in \mathbb{N}\}. \end{align*} $$

$\Phi _{1},\Phi _{2}:[1,+\infty )\rightarrow \mathbb {R}^{+}$

$\mathcal {G}(\Phi _{1})\!\setminus\! \mathcal {K}(\Phi _{2})$

$\mathcal {G}(\Phi )$

$\mathcal {K}(\Phi )$

$\Phi $

$\mathcal {G}(\Phi _{1})\!\setminus\! \mathcal {K}(\Phi _{2})$

$\Phi _1$

Let $0\leq \alpha \leq \infty $ , $0\leq a\leq b\leq \infty $ and $\psi $ be a positive function defined on $(0,\infty )$ . This paper is concerned with the growth of $L_{n}(x)$ , the largest digit of the first n terms in the Lüroth expansion of $x\in (0,1]$ . Under some suitable assumptions on the function $\psi $ , we completely determine the Hausdorff dimensions of the sets

$$\begin{align*}E_\psi(\alpha)=\bigg\{x\in(0,1]: \lim\limits_{n\rightarrow\infty}\frac{\log L_n(x)}{\log\psi(n)}=\alpha\bigg\} \end{align*}$$

and

$$\begin{align*}E_\psi(a,b)=\bigg\{x\in(0,1]: \liminf\limits_{n\rightarrow\infty}\frac{\log L_n(x)}{\log\psi(n)}=a, \limsup\limits_{n\rightarrow\infty}\frac{\log L_n(x)}{\log\psi(n)}=b\bigg\}. \end{align*}$$

We prove the convergence and ergodicity of a wide class of real and higher-dimensional continued fraction algorithms, including folded and $\alpha $ -type variants of complex, quaternionic, octonionic, and Heisenberg continued fractions, which we combine under the framework of Iwasawa continued fractions. The proof is based on the interplay of continued fractions and hyperbolic geometry, the ergodicity of geodesic flow in associated modular manifolds, and a variation on the notion of geodesic coding that we refer to as geodesic marking. As a corollary of our study of markable geodesics, we obtain a generalization of Serret’s tail-equivalence theorem for almost all points. The results are new even in the case of some real and complex continued fractions.

We consider the two-dimensional shrinking target problem in beta dynamical systems (for general $\beta>1$ ) with general errors of approximation. Let $f, g$ be two positive continuous functions. For any $x_0,y_0\in [0,1]$ , define the shrinking target set

$$ \begin{align*}E(T_\beta, f,g):=\left\{(x,y)\in [0,1]^2: \begin{array}{@{}ll@{}} \lvert T_{\beta}^{n}x-x_{0}\rvert <e^{-S_nf(x)}\\[1ex] \lvert T_{\beta}^{n}y-y_{0}\rvert < e^{-S_ng(y)} \end{array} \ {\text{for infinitely many}} \ n\in \mathbb N \right\}, \end{align*} $$

where $S_nf(x)=\sum _{j=0}^{n-1}f(T_\beta ^jx)$ is the Birkhoff sum. We calculate the Hausdorff dimension of this set and prove that it is the solution to some pressure function. This represents the first result of this kind for the higher-dimensional beta dynamical systems.

Given any rectangular polyhedron $3$ -manifold $\mathcal {P}$ tiled with unit cubes, we find infinitely many explicit directions related to cubic algebraic numbers such that all half-infinite geodesics in these directions are uniformly distributed in $\mathcal {P}$ .

In this paper, we discuss a connection between geometric measure theory and number theory. This method brings a new point of view for some number-theoretic problems concerning digit expansions. Among other results, we show that for each integer k, there is a number $M>0$ such that if $b_{1},\ldots ,b_{k}$ are multiplicatively independent integers greater than M, there are infinitely many integers whose base $b_{1},b_{2},\ldots ,b_{k}$ expansions all do not have any zero digits.

We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This parallels work of Harper for random Rademacher multiplicative functions over the integers.