Related papers: Tusn\'ady's problem, the transference principle, a…

We show that for every ergodic system $(X,\mu,T_1,\ldots,T_d)$ with commuting transformations, the average \[\frac{1}{N^{d+1}} \sum_{0\leq n_1,\ldots,n_d \leq N-1} \sum_{0\leq n\leq N-1} f_1(T_1^n \prod_{j=1}^d T_j^{n_j}x)f_2(T_2^n…

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

By a classical theorem of Koksma the sequence of fractional parts $(\{x^n\})_{n \geq 1}$ is uniformly distributed for almost all values of $x$. In the present paper we obtain an exact quantitative version of Koksma's theorem, by calculating…

We explain how the Transference Principles from Diophantine approximation can be interpreted in terms of geometry of the locally symmetric spaces $T_n=SO(n) \backslash SL(n,R) /SL(n,Z)$ with $n>1$, and how, via this dictionary, they become…

In this paper it is shown that if $\mu$ is an n-dimensional Ahlfors-David regular measure in $R^d$ which satisfies the so-called weak constant density condition, then $\mu$ is uniformly rectifiable. This had already been proved by David and…

The order $O_n(\sigma)$ of a permutation $\sigma$ of $n$ objects is the smallest integer $k \geq 1$ such that the $k$-th iterate of $\sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to…

Erd\H{o}s' unit distance problem and Erd\H{o}s' distinct distances problem are among the most classical and well-known open problems in discrete mathematics. They ask for the maximum number of unit distances, or the minimum number of…

A simple proof of the convergence of the variational regularization, with the regularization parameter, chosen by the discrepancy principle, is given for linear operators under suitable assumptions. It is shown that the discrepancy…

We show that for every non-spherical set $X$ in $\mathbb{E}^d$, there exists a natural number $m$ and a red/blue-colouring of $\mathbb{E}^n$ for every $n$ such that there is no red copy of X and no blue progression of length $m$ with each…

Existing two-sample testing techniques, particularly those based on choosing a kernel for the Maximum Mean Discrepancy (MMD), often assume equal sample sizes from the two distributions. Applying these methods in practice can require…

We consider the discrepancy problem of coloring $n$ intervals with $k$ colors such that at each point on the line, the maximal difference between the number of intervals of any two colors is minimal. Somewhat surprisingly, a coloring with…

This paper investigates the relationship between various measure-theoretic properties of U-statistics with fixed sample size $N$ and the same properties of their kernels. Specifically, the random variables are replaced with elements in some…

Let $T:[0,1]^d \rightarrow[0,1]^d$ be a piecewise expanding map with an absolutely continuous (with respect to the $d$-dimensional Lebesgue measure $m_d$) $T$-invariant probability measure $\mu$. Let $\left\{\mathbf{r}_n\right\}$ be a…

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Koml\'os, Major, and Tusn\'ady (KMT) [1975,1976]. The constants…

Upon specifying an equation of state, spherically symmetric steady states of the Einstein-Euler system are embedded in 1-parameter families of solutions, characterized by the value of their central redshift. In the 1960's Zel'dovich [50]…

Goemans showed that any $n$ points $x_1, \dotsc x_n$ in $d$-dimensions satisfying $\ell_2^2$ triangle inequalities can be embedded into $\ell_{1}$, with worst-case distortion at most $\sqrt{d}$. We extend this to the case when the points…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

We characterize all (absolute) 1-Lipschitz retracts Q of R^n with the maximum norm. Omitting two technical details, they coincide with the subsets written as the solution set of (at most) 2n inequalities like follows. For every coordinate…

Let $\psi:\mathbb{N} \to [0,\infty)$, $\psi(q)=q^{-(1+\tau)}$ and let $\psi$-badly approximable points be those vectors in $\mathbb{R}^{d}$ that are $\psi$-well approximable, but not $c\psi$-well approximable for arbitrarily small constants…