Given disjoint subsets T1, …, Tm of “not too large” primes up to x, we establish that for a random integer n drawn from [1, x], the m-dimensional vector enumerating the number of prime factors of n from T1, …, Tm converges to a vector of m independent Poisson random variables. We give a specific rate of convergence using the Kubilius model of prime factors. We also show a universal upper bound of Poisson type when T1, …, Tm are unrestricted, and apply this to the distribution of the number of prime factors from a set T conditional on n having k total prime factors.

In this paper we study the family of elliptic curves $E/{{\mathbb {Q}}}$, having good reduction at $2$ and $3$, and whose $j$-invariants are small. Within this set of elliptic curves, we consider the following two subfamilies: first, the set of elliptic curves $E$ such that the quotient $\Delta (E)/C(E)$ of the discriminant divided by the conductor is squarefree; and second, the set of elliptic curves $E$ such that the Szpiro quotient $\beta _E:=\log |\Delta (E)|/\log (C(E))$ is less than $7/4$. Both these families are conjectured to contain a positive proportion of elliptic curves, when ordered by conductor. Our main results determine asymptotics for both these families, when ordered by conductor. Moreover, we prove that the average size of the $2$-Selmer groups of elliptic curves in the first family, again when these curves are ordered by their conductors, is $3$. The key new ingredients necessary for the proofs are ‘uniformity estimates’, namely upper bounds on the number of elliptic curves with bounded height, whose discriminants are divisible by high powers of primes.

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.

Since Faltings proved Mordell’s conjecture in [16] in 1983, we have known that the sets of rational points on curves of genus at least $2$ are finite. Determining these sets in individual cases is still an unsolved problem. Chabauty’s method (1941) [10] is to intersect, for a prime number p, in the p-adic Lie group of p-adic points of the Jacobian, the closure of the Mordell–Weil group with the p-adic points of the curve. Under the condition that the Mordell–Weil rank is less than the genus, Chabauty’s method, in combination with other methods such as the Mordell–Weil sieve, has been applied successfully to determine all rational points in many cases.

Minhyong Kim’s nonabelian Chabauty programme aims to remove the condition on the rank. The simplest case, called quadratic Chabauty, was developed by Balakrishnan, Besser, Dogra, Müller, Tuitman and Vonk, and applied in a tour de force to the so-called cursed curve (rank and genus both $3$).

This article aims to make the quadratic Chabauty method small and geometric again, by describing it in terms of only ‘simple algebraic geometry’ (line bundles over the Jacobian and models over the integers).

Fix an abelian group $\Gamma $ and an injective endomorphism $F\colon \Gamma \to \Gamma $. Improving on the results of [2], new characterizations are here obtained for the existence of spanning sets, F-automaticity, and F-sparsity. The model theoretic status of these sets is also investigated, culminating with a combinatorial description of the F-sparse sets that are stable in $(\Gamma ,+)$, and a proof that the expansion of $(\Gamma ,+)$ by any F-sparse set is NIP. These methods are also used to show for prime $p\ge 7$ that the expansion of $(\mathbb {F}_p[t],+)$ by multiplication restricted to $t^{\mathbb {N}}$ is NIP.

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that relates true complexity to algebraic relations between the terms of the progression, and we prove it for a number of progressions, including $x, x+y, x+y^{2}, x+y+y^{2}$ and $x, x+y, x+2y, x+y^{2}$. As a corollary, we prove an asymptotic for the count of certain progressions of complexity 1 in subsets of finite fields. In the process, we obtain an equidistribution result for certain polynomial progressions, analogous to the counting lemma for systems of linear forms proved by Green and Tao.

By making use of the Cauchy double alternant and the Laplace expansion formula, we establish two closed formulae for the determinants of factorial fractions that are then utilised to evaluate several determinants of binomial coefficients and Catalan numbers, including those obtained recently by Chammam [‘Generalized harmonic numbers, Jacobi numbers and a Hankel determinant evaluation’, Integral Transforms Spec. Funct. 30(7) (2019), 581–593].

Gireesh and Mahadeva Naika [‘On 3-regular partitions in 3-colors’, Indian J. Pure Appl. Math. 50 (2019), 137–148] proved an infinite family of congruences modulo powers of 3 for the function $p_{\{3,3\}}(n)$, the number of 3-regular partitions in three colours. In this paper, using elementary generating function manipulations and classical techniques, we significantly extend the list of proven arithmetic properties satisfied by $p_{\{3,3\}}(n).$

Orthogonality is a fundamental theme in representation theory and Fourier analysis. An orthogonality relation for characters of finite abelian groups (now recognized as an orthogonality relation on $\mathrm {GL}(1)$) was used by Dirichlet to prove infinitely many primes in arithmetic progressions. Orthogonality relations for $\mathrm {GL}(2)$ and $\mathrm {GL}(3)$ have been worked on by many researchers with a broad range of applications to number theory. We present here, for the first time, very explicit orthogonality relations for the real group $\mathrm {GL}(4, \mathbb R)$ with a power savings error term. The proof requires novel techniques in the computation of the geometric side of the Kuznetsov trace formula.

Let q a prime power and ${\mathbb F}_q$ the finite field of q elements. We study the analogues of Mahler’s and Koksma’s classifications of complex numbers for power series in ${\mathbb F}_q((T^{-1}))$. Among other results, we establish that both classifications coincide, thereby answering a question of Ooto.

Let $X$ be a normal and geometrically integral projective variety over a global field $K$ and let $\bar {D}$ be an adelic ${\mathbb {R}}$-Cartier divisor on $X$. We prove a conjecture of Chen, showing that the essential minimum $\zeta _{\mathrm {ess}}(\bar {D})$ of $\bar {D}$ equals its asymptotic maximal slope under mild positivity assumptions. As an application, we see that $\zeta _{\mathrm {ess}}(\bar {D})$ can be read on the Okounkov body of the underlying divisor $D$ via the Boucksom–Chen concave transform. This gives a new interpretation of Zhang's inequalities on successive minima and a criterion for equality generalizing to arbitrary projective varieties a result of Burgos Gil, Philippon and Sombra concerning toric metrized divisors on toric varieties. When applied to a projective space $X = {\mathbb {P}}_K^{d}$, our main result has several applications to the study of successive minima of hermitian vector spaces. We obtain an absolute transference theorem with a linear upper bound, answering a question raised by Gaudron. We also give new comparisons between successive slopes and absolute minima, extending results of Gaudron and Rémond.

This paper explores the existence and distribution of primitive elements in finite field extensions with prescribed traces in several intermediate field extensions. Our main result provides an inequality-like condition to ensure the existence of such elements. We then derive concrete existence results for a special class of intermediate extensions.

The aim of this corrigendum is to correct an error in Corollary 10.7 to Theorem 10.6, one of the main results in the paper ‘On the cuspidal cohomology of $S$-arithmetic subgroups of reductive groups over number fields’. This makes necessary a thorough investigation of the conditions under which a Cartan-type automorphism exists on $G_1=\mathrm {Res}_{\mathbb {C}/\mathbb {R}}G_0$, where $G_0$ is a connected semisimple algebraic group defined over $\mathbb {R}$.

En s’appuyant sur la notion d’équivalence au sens de Bohr entre polynômes de Dirichlet et sur le fait que sur un corps quadratique la fonction zeta de Dedekind peut s’écrire comme produit de la fonction zeta de Riemann et d’une fonction L, nous montrons que, pour certaines valeurs du discriminant du corps quadratique, les sommes partielles de la fonction zeta de Dedekind ont leurs zéros dans des bandes verticales du plan complexe appelées bandes critiques et que les parties réelles de leurs zéros y sont denses.

We develop methods for constructing explicit generators, modulo torsion, of the $K_3$-groups of imaginary quadratic number fields. These methods are based on either tessellations of hyperbolic $3$-space or on direct calculations in suitable pre-Bloch groups and lead to the very first proven examples of explicit generators, modulo torsion, of any infinite $K_3$-group of a number field. As part of this approach, we make several improvements to the theory of Bloch groups for $ K_3 $ of any field, predict the precise power of $2$ that should occur in the Lichtenbaum conjecture at $ -1 $ and prove that this prediction is valid for all abelian number fields.

We prove that most permutations of degree $n$ have some power which is a cycle of prime length approximately $\log n$. Explicitly, we show that for $n$ sufficiently large, the proportion of such elements is at least $1-5/\log \log n$ with the prime between $\log n$ and $(\log n)^{\log \log n}$. The proportion of even permutations with this property is at least $1-7/\log \log n$.

We find all integer solutions to the equation $x^2+5^a\cdot 13^b\cdot 17^c=y^n$ with $a,\,b,\,c\geq 0$, $n\geq 3$, $x,\,y>0$ and $\gcd (x,\,y)=1$. Our proof uses a deep result about primitive divisors of Lucas sequences in combination with elementary number theory and computer search.

We prove a necessary and sufficient condition for isogenous elliptic curves based on the algebraic dependence of p-adic elliptic functions. As a consequence, we give a short proof of the p-adic analogue of Schneider’s theorem on the linear independence of p-adic elliptic logarithms of algebraic points on two nonisogenous elliptic curves defined over the field of algebraic numbers.

For any odd prime p, we construct an infinite family of imaginary quadratic fields whose class numbers are divisible by p. We give a corollary that settles Iizuka’s conjecture for the case n=1 and p>2.

We offer an alternative proof of a result of Conlon, Fox, Sudakov and Zhao [CFSZ20] on solving translation-invariant linear equations in dense Sidon sets. Our proof generalises to equations in more than five variables and yields effective bounds.