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.

In this short note, we give a proof, conditional on the generalised Riemann hypothesis, that there exist numbers $x$ which are normal with respect to the continued fraction expansion but not to any base- $b$ expansion. This partially answers a question of Bugeaud.

We show that if $A\subset \{1,\ldots ,N\}$ does not contain any nontrivial solutions to the equation $x+y+z=3w$ , then

$$\begin{eqnarray}|A|\leqslant \frac{N}{\exp (c(\log N)^{1/7})},\end{eqnarray}$$

$c>0$

$1/7$

$1/2$

$A+A+A$

$A\subset \{1,\ldots ,N\}$

$A\subset \mathbb{F}_{q}^{n}$

$A$

An important result of Weyl states that for every sequence $(a_{n})_{n\geqslant 1}$ of distinct positive integers the sequence of fractional parts of $(a_{n}{\it\alpha})_{n\geqslant 1}$ is uniformly distributed modulo one for almost all ${\it\alpha}$ . However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy of $(\{a_{n}{\it\alpha}\})_{n\geqslant 1}$ for almost all ${\it\alpha}$ . In particular, it is very difficult to give sharp lower bounds for the speed of convergence. Until now this was only carried out for lacunary sequences $(a_{n})_{n\geqslant 1}$ and for some special cases such as the Kronecker sequence $(\{n{\it\alpha}\})_{n\geqslant 1}$ or the sequence $(\{n^{2}{\it\alpha}\})_{n\geqslant 1}$ . In the present paper we answer the question for a large class of sequences $(a_{n})_{n\geqslant 1}$ including as a special case all polynomials $a_{n}=P(n)$ with $P\in \mathbb{Z}[x]$ of degree at least 2.

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\mapsto \unicode[STIX]{x1D6FD}x\,\text{mod}\,1$ . Further, define

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

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

$\unicode[STIX]{x1D6F9}:\mathbb{N}\rightarrow \mathbb{R}_{{>}0}$

$\unicode[STIX]{x1D6F9}(n)\rightarrow 0$

$n\rightarrow \infty$

Maillet proved that the set of Liouville numbers is preserved under rational functions with rational coefficients. Based on this result, a problem posed by Mahler is to investigate whether there exist entire transcendental functions with this property or not. For large parametrized classes of Liouville numbers, we construct such functions and moreover we show that they can be constructed such that all their derivatives share this property. We use a completely different approach than in a recent paper, where functions with a different invariant subclass of Liouville numbers were constructed (though with no information on derivatives). More generally, we study the image of Liouville numbers under analytic functions, with particular attention to $f(z)=z^{q}$, where $q$ is a rational number.

The calculation of multivariate normal probabilities is of great importance in many statistical and economic applications. In this paper we propose a spherical Monte Carlo method with both theoretical analysis and numerical simulation. We start by writing the multivariate normal probability via an inner radial integral and an outer spherical integral using the spherical transformation. For the outer spherical integral, we apply an integration rule by randomly rotating a predetermined set of well-located points. To find the desired set, we derive an upper bound for the variance of the Monte Carlo estimator and propose a set which is related to the kissing number problem in sphere packings. For the inner radial integral, we employ the idea of antithetic variates and identify certain conditions so that variance reduction is guaranteed. Extensive Monte Carlo simulations on some probabilities confirm these claims.

In 1981 Beck and Fiala proved an upper bound for the discrepancy of a set system of degree d that is independent of the size of the ground set. In the intervening years the bound has been decreased from 2d − 2 to 2d − 4. We improve the bound to 2d − log*d.

We provide a closed formula of Bowen type for the Hausdorff dimension of a very general shrinking target scheme generated by the nonautonomous dynamical system on the interval $[0,1)$, viewed as $\mathbb{R}/\mathbb{Z}$, corresponding to a given method of Cantor series expansion. We also examine a wide class of examples utilising our theorem. In particular, we give a Diophantine approximation interpretation of our scheme.