Let $\unicode[STIX]{x1D703}$ be an irrational number and $\unicode[STIX]{x1D711}:\mathbb{N}\rightarrow \mathbb{R}^{+}$ be a monotone decreasing function tending to zero. Let

$$\begin{eqnarray}E_{\unicode[STIX]{x1D711}}(\unicode[STIX]{x1D703})=\{y\in \mathbb{R}:\Vert n\unicode[STIX]{x1D703}-y\Vert <\unicode[STIX]{x1D711}(n),\text{for infinitely many }n\in \mathbb{N}\},\end{eqnarray}$$

$\unicode[STIX]{x1D711}(n)$

$E_{\unicode[STIX]{x1D711}}(\unicode[STIX]{x1D703})$

$\unicode[STIX]{x1D711}$

$\unicode[STIX]{x1D703}$

Let $\unicode[STIX]{x1D713}:\mathbb{R}_{+}\rightarrow \mathbb{R}_{+}$ be a non-increasing function. A real number $x$ is said to be $\unicode[STIX]{x1D713}$ -Dirichlet improvable if it admits an improvement to Dirichlet’s theorem in the following sense: the system

$$\begin{eqnarray}|qx-p|<\unicode[STIX]{x1D713}(t)\quad \text{and}\quad |q|<t\end{eqnarray}$$

$t$

$D(\unicode[STIX]{x1D713})$

$D(\unicode[STIX]{x1D713})^{c}$

$\unicode[STIX]{x1D713}$

We study the minimal gap statistic for fractional parts of sequences of the form ${\mathcal{A}}^{\unicode[STIX]{x1D6FC}}=\{\unicode[STIX]{x1D6FC}a(n)\}$, where ${\mathcal{A}}=\{a(n)\}$ is a sequence of distinct integers. Assuming that the additive energy of the sequence is close to its minimal possible value, we show that for almost all $\unicode[STIX]{x1D6FC}$, the minimal gap $\unicode[STIX]{x1D6FF}_{\min }^{\unicode[STIX]{x1D6FC}}(N)=\min \{\unicode[STIX]{x1D6FC}a(m)-\unicode[STIX]{x1D6FC}a(n)\hspace{0.2em}{\rm mod}\hspace{0.2em}1:1\leqslant m\neq n\leqslant N\}$ is close to that of a random sequence.

We generalize Skriganov’s notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such as aligned boxes. Our result improves on Skriganov’s celebrated counting result if the box is sufficiently distorted, the lattice is not admissible, and, e.g., symplectic or orthogonal. We establish a criterion under which our error term is sharp, and we provide examples in dimensions $2$ and $3$ using continued fractions. We also establish a similar counting result for primitive lattice points, and apply the latter to the classical problem of Diophantine approximation with primitive points as studied by Chalk, Erdős, and others. Finally, we use o-minimality to describe large classes of sets to which our counting results apply.

It has been known since Vinogradov that, for irrational $\unicode[STIX]{x1D6FC}$ , the sequence of fractional parts $\{\unicode[STIX]{x1D6FC}p\}$ is equidistributed in $\mathbb{R}/\mathbb{Z}$ as $p$ ranges over primes. There is a natural second-order equidistribution property, a pair correlation of such fractional parts, which has recently received renewed interest, in particular regarding its relation to additive combinatorics. In this paper we show that the primes do not enjoy this stronger equidistribution property.

Let $P^{+}(n)$ denote the largest prime factor of the integer $n$ and $P_{y}^{+}(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$ . In this paper, first we show that the triple consecutive integers with the two patterns $P^{+}(n-1)>P^{+}(n)<P^{+}(n+1)$ and $P^{+}(n-1)<P^{+}(n)>P^{+}(n+1)$ have a positive proportion respectively. More generally, with the same methods we can prove that for any$J\in \mathbb{Z}$ , $J\geqslant 3$ , the $J$ -tuple consecutive integers with the two patterns $P^{+}(n+j_{0})=\min _{0\leqslant j\leqslant J-1}P^{+}(n+j)$ and $P^{+}(n+j_{0})=\max _{0\leqslant j\leqslant J-1}P^{+}(n+j)$ also have a positive proportion, respectively. Second, for $y=x^{\unicode[STIX]{x1D703}}$ with $0<\unicode[STIX]{x1D703}\leqslant 1$ we show that there exists a positive proportion of integers $n$ such that $P_{y}^{+}(n)<P_{y}^{+}(n+1)$ . Specifically, we can prove that the proportion of integers $n$ such that $P^{+}(n)<P^{+}(n+1)$ is larger than 0.1356, which improves the previous result “0.1063” of the author.

In this paper, we investigate the two-dimensional shrinking target problem in beta-dynamical systems. Let $\unicode[STIX]{x1D6FD}>1$ be a real number and define the $\unicode[STIX]{x1D6FD}$ -transformation on $[0,1]$ by $T_{\unicode[STIX]{x1D6FD}}:x\rightarrow \unicode[STIX]{x1D6FD}x\;\text{mod}\;1$ . Let $\unicode[STIX]{x1D6F9}_{i}$ ( $i=1,2$ ) be two positive functions on $\mathbb{N}$ such that $\unicode[STIX]{x1D6F9}_{i}\rightarrow 0$ when $n\rightarrow \infty$ . We determine the Lebesgue measure and Hausdorff dimension for the $\limsup$ set

$$\begin{eqnarray}W(T_{\unicode[STIX]{x1D6FD}},\unicode[STIX]{x1D6F9}_{1},\unicode[STIX]{x1D6F9}_{2})=\{(x,y)\in [0,1]^{2}:|T_{\unicode[STIX]{x1D6FD}}^{n}x-x_{0}|<\unicode[STIX]{x1D6F9}_{1}(n),|T_{\unicode[STIX]{x1D6FD}}^{n}y-y_{0}|<\unicode[STIX]{x1D6F9}_{2}(n)\text{ for infinitely many }n\in \mathbb{N}\}\end{eqnarray}$$

$x_{0},y_{0}\in [0,1]$

Let $b$ be an integer larger than 1. We give an asymptotic formula for the exponential sum

$$\begin{eqnarray}\mathop{\sum }_{\substack{ p\leqslant x \\ g(p)=k}}\exp \big(2\text{i}\unicode[STIX]{x1D70B}\unicode[STIX]{x1D6FD}p\big),\end{eqnarray}$$

$p$

$\unicode[STIX]{x1D6FD}\in \mathbb{R}$

$k\in \mathbb{Z}$

$g:\mathbb{N}\rightarrow \mathbb{Z}$

$b$

$\operatorname{pgcd}(g(1),\ldots ,g(b-1))=1$

A seminal result due to Wall states that if $x$ is normal to a given base $b$ , then so is $rx+s$ for any rational numbers $r,s$ with $r\neq 0$ . We show that a stronger result is true for normality with respect to the continued fraction expansion. In particular, suppose $a,b,c,d\in \mathbb{Z}$ with $ad-bc\neq 0$ . Then if $x$ is continued fraction normal, so is $(ax+b)/(cx+d)$ .

We consider finite point subsets (distributions) in compact metric spaces. In the case of general rectifiable metric spaces, non-trivial bounds for sums of distances between points of distributions and for discrepancies of distributions in metric balls are given (Theorem 1.1). We generalize Stolarsky’s invariance principle to distance-invariant spaces (Theorem 2.1). For arbitrary metric spaces, we prove a probabilistic invariance principle (Theorem 3.1). Furthermore, we construct equal-measure partitions of general rectifiable compact metric spaces into parts of small average diameter (Theorem 4.1).

This paper is motivated by Davenport’s problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidean space. We study the problem in the area of twisted Diophantine approximation and present two different approaches. The first approach shows that, under a certain restriction, any countable intersection of the sets of weighted badly approximable points on any non-degenerate ${\mathcal{C}}^{1}$ submanifold of $\mathbb{R}^{n}$ has full dimension. In the second approach, we introduce the property of isotropically winning and show that the sets of weighted badly approximable points are isotropically winning under the same restriction as above.

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an $n$ -point set $P$ , and a collection ${\mathcal{F}}=\{F_{1},\ldots ,F_{m}\}$ of subsets of $P$ , and our goal is color $P$ with two colors, red and blue, so that the maximum over the $F_{i}$ of the absolute difference between the number of red elements and the number of blue elements (the discrepancy) is minimized. Combinatorial discrepancy has many applications in mathematics and computer science, including constructions of uniformly distributed point sets, and lower bounds for data structures and private data analysis algorithms. We investigate the combinatorial discrepancy of geometrically defined systems, in which $P$ is an $n$ -point set in $d$ -dimensional space, and ${\mathcal{F}}$ is the collection of subsets of $P$ induced by dilations and translations of a fixed convex polytope $B$ . Such set systems include systems of sets induced by axis-aligned boxes, whose discrepancy is the subject of the well-known Tusnády problem. We prove new discrepancy upper and lower bounds for such set systems by extending the approach based on factorization norms previously used by the author, Matoušek, and Talwar. We also outline applications of our results to geometric discrepancy, data structure lower bounds, and differential privacy.

The discrepancy function measures the deviation of the empirical distribution of a point set in $[0,1]^{d}$ from the uniform distribution. In this paper, we study the classical discrepancy function with respect to the bounded mean oscillation and exponential Orlicz norms, as well as Sobolev, Besov and Triebel–Lizorkin norms with dominating mixed smoothness. We give sharp bounds for the discrepancy function under such norms with respect to infinite sequences.

The multiplicative group generated by a certain sequence of rationals is determined, settling a 30-year conjecture.

The computation of integrals in higher dimensions and on general domains, when no explicit cubature rules are known, can be ”easily” addressed by means of the quasi-Monte Carlo method. The method, simple in its formulation, becomes computationally inefficient when the space dimension is growing and the integration domain is particularly complex. In this paper we present two new approaches to the quasi-Monte Carlo method for cubature based on nonnegative least squares and approximate Fekete points. The main idea is to use less points and especially good points for solving the system of the moments. Good points are here intended as points with good interpolation properties, due to the strict connection between interpolation and cubature. Numerical experiments show that, in average, just a tenth of the points should be used mantaining the same approximation order of the quasi-Monte Carlo method. The method has been satisfactory applied to 2 and 3-dimensional problems on quite complex domains.

In this paper, we exhibit explicit automorphisms of maximal Salem degree 22 on the supersingular K3 surface of Artin invariant one for all primes $p\equiv 3~\text{mod}\,4$ in a systematic way. Automorphisms of Salem degree 22 do not lift to any characteristic zero model.

Let $\{f_{n}\}_{n\geq 1}$ be an infinite iterated function system on $[0,1]$ and let $\unicode[STIX]{x1D6EC}$ be its attractor. Then, for any $x\in \unicode[STIX]{x1D6EC}$ , it corresponds to a sequence of integers $\{a_{n}(x)\}_{n\geq 1}$ , called the digit sequence of $x$ , in the sense that

$$\begin{eqnarray}x=\lim _{n\rightarrow \infty }f_{a_{1}(x)}\circ \cdots \circ f_{a_{n}(x)}(1).\end{eqnarray}$$

We study the problem of Diophantine approximation on lines in $\mathbb{R}^{d}$ under certain primality restrictions.

For natural integer n, let D n denote the random variable taking the values log d for d dividing n with uniform probability 1/τ(n). Then t↦ℙ(D n ≤n t ) (0≤t≤1) is an arithmetic process with respect to the uniform probability over the first N integers. It is known from previous works that this process converges to a limit law and that the same holds for various extensions. We investigate the generalized moments of arbitrary orders for the limit laws. We also evaluate the mean value of the two-dimensional distribution function ℙ(D n ≤n u , D{n/D n}≤n v ).

We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give an affirmative answer to the analogue in this setting of a famous conjecture of Schmidt from Diophantine approximation.