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.

The paper deals with the sets of numbers from [0,1] such that their binary representation is almost convergent. The aim of the study is to compute the Hausdorff dimensions of such sets. Previously, the results of this type were proved for a single summation method (e.g. Cesàro, Abel, Toeplitz). This study extends the results to a wide range of matrix summation methods.

For any x in $[0,1)$, let $[a_1(x),a_2(x),a_3(x),\ldots ]$ be its continued fraction. Let $\psi :\mathbb {N}\to \mathbb {R}^+$ be such that $\psi (n) \to \infty $ as $n\to \infty $. For any positive integers s and t, we study the set

$$ \begin{align*}E(\psi)=\{(x,y)\in [0,1)^2: \max\{a_{sn}(x), a_{tn}(y)\}\ge \psi(n) \ {\text{for all sufficiently large}}\ n\in \mathbb{N}\} \end{align*} $$

and determine its Hausdorff dimension.

This paper is concerned with the growth rate of the product of consecutive partial quotients relative to the denominator of the convergent for the continued fraction expansion of an irrational number. More precisely, given a natural number $m,$ we determine the Hausdorff dimension of the following set:

$$ \begin{align*} E_m(\tau)=\bigg\{x\in [0,1): \limsup\limits_{n\rightarrow\infty}\frac{\log (a_n(x)a_{n+1}(x)\cdots a_{n+m}(x))}{\log q_n(x)}=\tau\bigg\}, \end{align*} $$

where $\tau $ is a nonnegative number. This extends the dimensional result of Dirichlet nonimprovable sets (when $m=1$) shown by Hussain, Kleinbock, Wadleigh and Wang.

A Cantor series expansion for a real number x with respect to a basic sequence $Q=(q_1,q_2,\dots )$, where $q_i \geq 2$, is a generalization of the base b expansion to an infinite sequence of bases. Ki and Linton in 1994 showed that for ordinary base b expansions the set of normal numbers is a $\boldsymbol {\Pi }^0_3$-complete set, establishing the exact complexity of this set. In the case of Cantor series there are three natural notions of normality: normality, ratio normality, and distribution normality. These notions are equivalent for base b expansions, but not for more general Cantor series expansions. We show that for any basic sequence the set of distribution normal numbers is $\boldsymbol {\Pi }^0_3$-complete, and if Q is $1$-divergent then the sets of normal and ratio normal numbers are $\boldsymbol {\Pi }^0_3$-complete. We further show that all five non-trivial differences of these sets are $D_2(\boldsymbol {\Pi }^0_3)$-complete if $\lim _i q_i=\infty $ and Q is $1$-divergent. This shows that except for the trivial containment that every normal number is ratio normal, these three notions are as independent as possible.

Given an infinite subset $\mathcal{A} \subseteq\mathbb{N}$, let A denote its smallest N elements. There is a rich and growing literature on the question of whether for typical $\alpha\in[0,1]$, the pair correlations of the set $\alpha A (\textrm{mod}\ 1)\subset [0,1]$ are asymptotically Poissonian as N increases. We define an inhomogeneous generalisation of the concept of pair correlation, and we consider the corresponding doubly metric question. Many of the results from the usual setting carry over to this new setting. Moreover, the double metricity allows us to establish some new results whose singly metric analogues are missing from the literature.

We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realisation of a fractal percolation process, then almost surely (conditioned on $E\neq\emptyset$), for every countable collection $\left(f_{i}\right)_{i\in\mathbb{N}}$ of $C^{1}$ diffeomorphisms of $\mathbb{R}^{d}$, $\dim_{H}\left(E\cap\left(\bigcap_{i\in\mathbb{N}}f_{i}\left(\text{BA}_{d}\right)\right)\right)=\dim_{H}\left(E\right)$, where $\text{BA}_{d}$ is the set of badly approximable vectors in $\mathbb{R}^{d}$. We show this by proving that E almost surely contains hyperplane diffuse subsets which are Ahlfors-regular with dimensions arbitrarily close to $\dim_{H}\left(E\right)$.

We achieve this by analysing Galton–Watson trees and showing that they almost surely contain appropriate subtrees whose projections to $\mathbb{R}^{d}$ yield the aforementioned subsets of E. This method allows us to obtain a more general result by projecting the Galton–Watson trees against any similarity IFS whose attractor is not contained in a single affine hyperplane. Thus our general result relates to a broader class of random fractals than fractal percolation.

An effective estimate for the measure of the set of real numbers for which the inequality |P(x)|<Q-w for $w > {3 \over 2}n + 1$ has a solution in integral polynomials P of degree n and of height H(P) at most $Q \in {\rm{\mathbb N}}$ is obtained.

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in A if they are the vertices of a convex polytope, which contains no points of A in its interior. We construct arbitrarily large point sets in general position in $\mathbb{R}^d$ having no holes of size $O(4^dd\log d)$ or more. This improves the previously known upper bound of order $d^{d+o(d)}$ due to Valtr. The basic version of our construction uses a certain type of equidistributed point sets, originating from numerical analysis, known as (t,m,s)-nets or (t,s)-sequences, yielding a bound of $2^{7d}$. The better bound is obtained using a variant of (t,m,s)-nets, obeying a relaxed equidistribution condition.

We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to +\infty $. We also resolve some natural variants of the problem concerning points with prime coordinates and points that are visible from the origin.

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 $S_{\alpha ,N}$ is consistent with the Poisson model (in the limit as N tends to infinity). In this paper, we prove a new estimate for the triple correlations associated with this problem, establishing an asymptotic expression for the third moment of the number of elements of $S_{\alpha ,N}$ in a random interval of length $L/N$, provided that $L> N^{1/4+\varepsilon }$. The threshold of $\tfrac {1}{4}$ is substantially smaller than the threshold of $\tfrac {1}{2}$ (which is the threshold that would be given by a naïve discrepancy estimate).

Unlike the theory of pair correlations, rather little is known about triple correlations of the dilations $(\alpha a_n \, \text {mod } 1)_{n=1}^{\infty } $ for a nonlacunary sequence $(a_n)_{n=1}^{\infty } $ of increasing integers. This is partially due to the fact that the second moment of the triple correlation function is difficult to control, and thus standard techniques involving variance bounds are not applicable. We circumvent this impasse by using an argument inspired by works of Rudnick, Sarnak, and Zaharescu, and Heath-Brown, which connects the triple correlation function to some modular counting problems.

In Appendix B, we comment on the relationship between discrepancy and correlation functions, answering a question of Steinerberger.

In this article we aim to investigate the Hausdorff dimension of the set of points $x \in [0,1)$ such that for any $r\in \mathbb {N}$,

$$ \begin{align*} a_{n+1}(x)a_{n+2}(x)\cdots a_{n+r}(x)\geq e^{\tau(x)(h(x)+\cdots+h(T^{n-1}(x)))} \end{align*} $$

$n\in \mathbb {N}$

$\tau $

$a_{n}(x)$

$r,\tau (x)$

$h(x)$

We prove the logarithmic Sarnak conjecture for sequences of subquadratic word growth. In particular, we show that the Liouville function has at least quadratically many sign patterns. We deduce the main theorem from a variant which bounds the correlations between multiplicative functions and sequences with subquadratically many words which occur with positive logarithmic density. This allows us to actually prove that our multiplicative functions do not locally correlate with sequences of subquadratic word growth. We also prove a conditional result which shows that if the ($\kappa -1$)-Fourier uniformity conjecture holds then the Liouville function does not correlate with sequences with $O(n^{t-\varepsilon })$ many words of length n where $t = \kappa (\kappa +1)/2$. We prove a variant of the $1$-Fourier uniformity conjecture where the frequencies are restricted to any set of box dimension less than $1$.

The level of distribution of a complex-valued sequence $b$ measures the quality of distribution of $b$ along sparse arithmetic progressions $nd+a$. We prove that the Thue–Morse sequence has level of distribution $1$, which is essentially best possible. More precisely, this sequence gives one of the first nontrivial examples of a sequence satisfying a Bombieri–Vinogradov-type theorem for each exponent $\theta <1$. This result improves on the level of distribution $2/3$ obtained by Müllner and the author. As an application of our method, we show that the subsequence of the Thue–Morse sequence indexed by $\lfloor n^c\rfloor$, where $1 < c < 2$, is simply normal. This result improves on the range $1 < c < 3/2$ obtained by Müllner and the author and closes the gap that appeared when Mauduit and Rivat proved (in particular) that the Thue–Morse sequence along the squares is simply normal.

As pointed out by Alexandre Bailleul, the paper mentioned in the title contains a mistake in Theorem 2.2. The hypothesis on the linear relation of the almost periods is not sufficient. In this note, we fix the problem and its minor consequences on other results in the same paper.

Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo q satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \ (\mathrm{mod}\ q)$. We conditionally derive an asymptotic formula, with an error term that has a power savings in q, for the logarithmic density of the set of real numbers x for which $\pi (x;q,a_1)> \pi (x;q,a_2) > \pi (x;q,a_3)$. The relationship among the $a_i$ allows us to normalize the error terms for the $\pi (x;q,a_i)$ in an atypical way that creates mutual independence among their distributions, and also allows for a proof technique that uses only elementary tools from probability.