Search for: All records

Abstract The Erdős–Hooley Delta function is defined for as . We prove that for all . This improves on earlier work of Hooley, Hall–Tenenbaum, and La Bretèche–Tenenbaum. 

Abstract We prove an extension of the Moore–Schmidt theorem on the triviality of the first cohomology class of cocycles for the action of an arbitrary discrete group on an arbitrary measure space and for cocycles with values in an arbitrary compact Hausdorff abelian group. The proof relies on a ‘conditional’ Pontryagin duality for spaces of abstract measurable maps. 

Abstract Singmaster’s conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal’s triangle; that is, for any natural number $$t \geq 2$$, the number of solutions to the equation $$\binom{n}{m} = t$$ for natural numbers $$1 \leq m \lt n$$ is bounded. In this paper we establish this result in the interior region $$\exp(\log^{2/3+\varepsilon} n) \leq m \leq n - \exp(\log^{2/3+\varepsilon} n)$$ for any fixed ɛ > 0. Indeed, when t is sufficiently large depending on ɛ, we show that there are at most four solutions (or at most two in either half of Pascal’s triangle) in this region. We also establish analogous results for the equation $$(n)_m = t$$, where $$(n)_m := n(n-1) \dots (n-m+1)$$ denotes the falling factorial. 

Abstract We construct an example of a group$$G = \mathbb {Z}^2 \times G_0$$ $G=Z^2\times G_0$for a finite abelian group $$G_0$$ $G_0$, a subsetEof $$G_0$$ $G_0$, and two finite subsets$$F_1,F_2$$ $F_1,F_2$of G, such that it is undecidable in ZFC whether$$\mathbb {Z}^2\times E$$ $Z^2\times E$can be tiled by translations of$$F_1,F_2$$ $F_1,F_2$. In particular, this implies that this tiling problem isaperiodic, in the sense that (in the standard universe of ZFC) there exist translational tilings ofEby the tiles$$F_1,F_2$$ $F_1,F_2$, but no periodic tilings. Previously, such aperiodic or undecidable translational tilings were only constructed for sets of eleven or more tiles (mostly in $$\mathbb {Z}^2$$ $Z^2$). A similar construction also applies for$$G=\mathbb {Z}^d$$ $G=Z^d$for sufficiently large d. If one allows the group$$G_0$$ $G_0$to be non-abelian, a variant of the construction produces an undecidable translational tiling with only one tile F. The argument proceeds by first observing that a single tiling equation is able to encode an arbitrary system of tiling equations, which in turn can encode an arbitrary system of certain functional equations once one has two or more tiles. In particular, one can use two tiles to encode tiling problems for an arbitrary number of tiles. 

Abstract Define theCollatz map$${\operatorname {Col}} \colon \mathbb {N}+1 \to \mathbb {N}+1$$on the positive integers$$\mathbb {N}+1 = \{1,2,3,\dots \}$$by setting$${\operatorname {Col}}(N)$$equal to$$3N+1$$whenNis odd and$$N/2$$whenNis even, and let$${\operatorname {Col}}_{\min }(N) := \inf _{n \in \mathbb {N}} {\operatorname {Col}}^n(N)$$denote the minimal element of the Collatz orbit$$N, {\operatorname {Col}}(N), {\operatorname {Col}}^2(N), \dots $$. The infamousCollatz conjectureasserts that$${\operatorname {Col}}_{\min }(N)=1$$for all$$N \in \mathbb {N}+1$$. Previously, it was shown by Korec that for any$$\theta> \frac {\log 3}{\log 4} \approx 0.7924$$, one has$${\operatorname {Col}}_{\min }(N) \leq N^\theta $$for almost all$$N \in \mathbb {N}+1$$(in the sense of natural density). In this paper, we show that foranyfunction$$f \colon \mathbb {N}+1 \to \mathbb {R}$$with$$\lim _{N \to \infty } f(N)=+\infty $$, one has$${\operatorname {Col}}_{\min }(N) \leq f(N)$$for almost all$$N \in \mathbb {N}+1$$(in the sense of logarithmic density). Our proof proceeds by establishing a stabilisation property for a certain first passage random variable associated with the Collatz iteration (or more precisely, the closely related Syracuse iteration), which in turn follows from estimation of the characteristic function of a certain skew random walk on a$$3$$-adic cyclic group$$\mathbb {Z}/3^n\mathbb {Z}$$at high frequencies. This estimation is achieved by studying how a certain two-dimensional renewal process interacts with a union of triangles associated to a given frequency. 

Let $\mathrm{\Gamma <\#comment/>}$be a countable abelian group. An (abstract) $\mathrm{\Gamma <\#comment/>}$-system $\mathrm{X}$- that is, an (abstract) probability space equipped with an (abstract) probability-preserving action of $\mathrm{\Gamma <\#comment/>}$- is said to be aConze–Lesigne systemif it is equal to its second Host–Kra–Ziegler factor ${\mathrm{Z}}^2\left(\mathrm{X}\right)$. The main result of this paper is a structural description of such Conze–Lesigne systems for arbitrary countable abelian $\mathrm{\Gamma <\#comment/>}$, namely that they are the inverse limit of translational systems $G_n/{\mathrm{\Lambda <\#comment/>}}_n$arising from locally compact nilpotent groups $G_n$of nilpotency class $2$, quotiented by a lattice ${\mathrm{\Lambda <\#comment/>}}_n$. Results of this type were previously known when $\mathrm{\Gamma <\#comment/>}$was finitely generated, or the product of cyclic groups of prime order. In a companion paper, two of us will apply this structure theorem to obtain an inverse theorem for the Gowers $U^3\left(G\right)$norm for arbitrary finite abelian groups $G$. 

Abstract We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we obtain heuristic upper and lower bounds for the size of the largest prime gap in the interval $[1,x]$ [ 1 , x ] . Our results are stated in terms of the extremal bounds in the interval sieve problem. The same methods also allow us to rigorously relate the validity of the Hardy-Littlewood conjectures for an arbitrary set (such as the actual primes) to lower bounds for the largest gaps within that set. 

We state and prove a quantitative inverse theorem for the Gowers uniformity norm U3(G) on an arbitrary finite abelian group G; the cases when G was of odd order or a vector space over F2 had previously been established by Green and the second author and by Samorodnitsky respectively by Fourier-analytic methods, which we also employ here. We also prove a qualitative version of this inverse theorem using a structure theorem of Host--Kra type for ergodic Zω-actions of order 2 on probability spaces established recently by Shalom and the authors.