Under sufficiently strong assumptions about the first prime in an arithmetic progression, we prove that the number of Carmichael numbers up to $X$ is $\gg X^{1-R}$, where $R=(2+o(1))\log \log \log \log X/\text{log}\log \log X$. This is close to Pomerance’s conjectured density of $X^{1-R}$ with $R=(1+o(1))\log \log \log X/\text{log}\log X$.

A system of quadratic forms is associated to every generalised quadratic form over a division algebra with involution of the first kind in characteristic two. It is shown that this system determines the isotropy behaviour and the isometry class of generalised quadratic forms. An application of this construction to the Witt index of generalised quadratic forms is also given.

For an irrational number $x\in [0,1)$, let $x=[a_{1}(x),a_{2}(x),\ldots ]$ be its continued fraction expansion with partial quotients $\{a_{n}(x):n\geq 1\}$. Given $\unicode[STIX]{x1D6E9}\in \mathbb{N}$, for $n\geq 1$, the $n$th longest block function of $x$ with respect to $\unicode[STIX]{x1D6E9}$ is defined by $L_{n}(x,\unicode[STIX]{x1D6E9})=\max \{k\geq 1:a_{j+1}(x)=\cdots =a_{j+k}(x)=\unicode[STIX]{x1D6E9}~\text{for some}~j~\text{with}~0\leq j\leq n-k\}$, which represents the length of the longest consecutive sequence whose elements are all $\unicode[STIX]{x1D6E9}$ from the first $n$ partial quotients of $x$. We consider the growth rate of $L_{n}(x,\unicode[STIX]{x1D6E9})$ as $n\rightarrow \infty$ and calculate the Hausdorff dimensions of the level sets and exceptional sets arising from the longest block function.

In this note we use some $q$-congruences proved by the method of ‘creative microscoping’ to prove two conjectures on supercongruences involving central binomial coefficients. In particular, we confirm the $m=5$ case of Conjecture 1.1 of Guo [‘Some generalizations of a supercongruence of Van Hamme’, Integral Transforms Spec. Funct.28 (2017), 888–899].

We establish various new results on a problem proposed by Mahler [Some suggestions for further research. Bull. Aust. Math. Soc.29 (1984), 101–108] concerning rational approximation to fractal sets by rational numbers inside and outside the set in question. Some of them provide a natural continuation and improvement of recent results of Broderick, Fishman and Reich, and Fishman and Simmons. A key feature is that many of our new results apply to more general, multi-dimensional fractal sets and require only mild assumptions on the iterated function system. Moreover, we provide a non-trivial lower bound for the distance of a rational number $p/q$ outside the Cantor middle-third set $C$ to the set $C$ , in terms of the denominator $q$ . We further discuss patterns of rational numbers in fractal sets. We highlight two of them: firstly, an upper bound for the number of rational (algebraic) numbers in a fractal set up to a given height (and degree) for a wide class of fractal sets; and secondly, we find properties of the denominator structure of rational points in ‘missing-digit’ Cantor sets, generalizing claims of Nagy and Bloshchitsyn.

The generalized Soulé character was introduced by H. Nakamura and Z. Wojtkowiak and is a generalization of Soulé’s cyclotomic character. In this paper, we prove that certain linear sums of generalized Soulé characters essentially coincide with the image of generalized Beilinson elements in K-groups under Soulé’s higher regulator maps. This result generalizes Huber–Wildeshaus’ theorem, which is a cyclotomic field case of our results, to an arbitrary number fields.

Let $K=\mathbb{Q}(\unicode[STIX]{x1D714})$ with $\unicode[STIX]{x1D714}$ the root of a degree $n$ monic irreducible polynomial $f\in \mathbb{Z}[X]$. We show that the degree $n$ polynomial $N(\sum _{i=1}^{n-k}x_{i}\unicode[STIX]{x1D714}^{i-1})$ in $n-k$ variables takes the expected asymptotic number of prime values if $n\geqslant 4k$. In the special case $K=\mathbb{Q}(\sqrt[n]{\unicode[STIX]{x1D703}})$, we show that $N(\sum _{i=1}^{n-k}x_{i}\sqrt[n]{\unicode[STIX]{x1D703}^{i-1}})$ takes infinitely many prime values, provided $n\geqslant 22k/7$.

Our proof relies on using suitable ‘Type I’ and ‘Type II’ estimates in Harman’s sieve, which are established in a similar overall manner to the previous work of Friedlander and Iwaniec on prime values of $X^{2}+Y^{4}$ and of Heath-Brown on $X^{3}+2Y^{3}$. Our proof ultimately relies on employing explicit elementary estimates from the geometry of numbers and algebraic geometry to control the number of highly skewed lattices appearing in our final estimates.

A well-known conjecture, often attributed to Serre, asserts that any motive over any number field has infinitely many ordinary reductions (in the sense that the Newton polygon coincides with the Hodge polygon). In the case of Hilbert modular cuspforms $f$ of parallel weight $(2,\ldots ,2)$, we show how to produce more ordinary primes by using the Sato–Tate equidistribution and combining it with the Galois theory of the Hecke field. Under the assumption of stronger forms of Sato–Tate equidistribution, we get stronger (but conditional) results. In the case of higher weights, we formulate the ordinariness conjecture for submotives of the intersection cohomology of proper algebraic varieties with motivic coefficients, and verify it for the motives whose $\ell$-adic Galois realisations are abelian on a finite-index subgroup. We get some results for Hilbert cuspforms of weight $(3,\ldots ,3)$, weaker than those for $(2,\ldots ,2)$.

In this paper, we investigate $\unicode[STIX]{x1D70B}(m,n)$, the number of partitions of the bipartite number$(m,n)$ into steadily decreasing parts, introduced by Carlitz [‘A problem in partitions’, Duke Math. J.30 (1963), 203–213]. We give a relation between $\unicode[STIX]{x1D70B}(m,n)$ and the crank statistic $M(m,n)$ for integer partitions. Using this relation, we establish some uniform asymptotic formulas for $\unicode[STIX]{x1D70B}(m,n)$.

We present a complete characterisation of the radial asymptotics of degree-one Mahler functions as $z$ approaches roots of unity of degree $k^{n}$, where $k$ is the base of the Mahler function, as well as some applications concerning transcendence and algebraic independence. For example, we show that the generating function of the Thue–Morse sequence and any Mahler function (to the same base) which has a nonzero Mahler eigenvalue are algebraically independent over $\mathbb{C}(z)$. Finally, we discuss asymptotic bounds towards generic points on the unit circle.

We give a new hypergeometric construction of rational approximations to ζ(4), which absorbs the earlier one from 2003 based on Bailey's 9F8 hypergeometric integrals. With the novel ingredients we are able to gain better control of the arithmetic and produce a record irrationality measure for ζ(4).

We generalize current known distribution results on Shanks–Rényi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function field analogues developed in the recent years. More precisely, let $\unicode[STIX]{x1D70B}(x;q,a)$ be the number of primes up to $x$ that are congruent to $a$ modulo $q$. For a fixed integer $q$ and distinct invertible congruence classes $a_{0},a_{1},\ldots ,a_{D}$, assuming the generalized Riemann Hypothesis and a weak version of the linear independence hypothesis, we show that the set of real $x$ for which the inequalities $\unicode[STIX]{x1D70B}(x;q,a_{0})>\unicode[STIX]{x1D70B}(x;q,a_{1})>\cdots >\unicode[STIX]{x1D70B}(x;q,a_{D})$ are simultaneously satisfied admits a logarithmic density.

Let ${\mathcal{A}}$ be a star-shaped polygon in the plane, with rational vertices, containing the origin. The number of primitive lattice points in the dilate $t{\mathcal{A}}$ is asymptotically $\frac{6}{\unicode[STIX]{x1D70B}^{2}}\text{Area}(t{\mathcal{A}})$ as $t\rightarrow \infty$. We show that the error term is both $\unicode[STIX]{x1D6FA}_{\pm }(t\sqrt{\log \log t})$ and $O(t(\log t)^{2/3}(\log \log t)^{4/3})$. Both bounds extend (to the above class of polygons) known results for the isosceles right triangle, which appear in the literature as bounds for the error term in the summatory function for Euler’s $\unicode[STIX]{x1D719}(n)$.

Higher dimensional analogues of the modular group $\mathit{PSL}(2,\mathbb{Z})$ are closely related to hyperbolic reflection groups and Coxeter polyhedra with big symmetry groups. In this context, we develop a theory and dissection properties of ideal hyperbolic $k$-rectified regular polyhedra, which is of independent interest. As an application, we can identify the covolumes of the quaternionic modular groups with certain explicit rational multiples of the Riemann zeta value $\unicode[STIX]{x1D701}(3)$.

In this paper, we prove a conjecture of Wei Zhang on comparison of certain local relative characters from which we draw some consequences for the Ichino–Ikeda conjecture for unitary groups.

We determine the order of magnitude of $\mathbb{E}|\sum _{n\leqslant x}f(n)|^{2q}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, and $0\leqslant q\leqslant 1$. In the Steinhaus case, this is equivalent to determining the order of $\lim _{T\rightarrow \infty }\frac{1}{T}\int _{0}^{T}|\sum _{n\leqslant x}n^{-it}|^{2q}\,dt$.

In particular, we find that $\mathbb{E}|\sum _{n\leqslant x}f(n)|\asymp \sqrt{x}/(\log \log x)^{1/4}$. This proves a conjecture of Helson that one should have better than squareroot cancellation in the first moment and disproves counter-conjectures of various other authors. We deduce some consequences for the distribution and large deviations of $\sum _{n\leqslant x}f(n)$.

The proofs develop a connection between $\mathbb{E}|\sum _{n\leqslant x}f(n)|^{2q}$ and the $q$th moment of a critical, approximately Gaussian, multiplicative chaos and then establish the required estimates for that. We include some general introductory discussion about critical multiplicative chaos to help readers unfamiliar with that area.

Recently, Brietzke, Silva and Sellers [‘Congruences related to an eighth order mock theta function of Gordon and McIntosh’, J. Math. Anal. Appl.479 (2019), 62–89] studied the number $v_{0}(n)$ of overpartitions of $n$ into odd parts without gaps between the nonoverlined parts, whose generating function is related to the mock theta function $V_{0}(q)$ of order 8. In this paper we first present a short proof of the 3-dissection for the generating function of $v_{0}(2n)$. Then we establish three congruences for $v_{0}(n)$ along certain progressions which are subsequences of the integers $4n+3$.

Let $F_{n}$ and $L_{n}$ be the Fibonacci and Lucas numbers, respectively. Four corresponding zeta functions in $s$ are defined by

$$\begin{eqnarray}\unicode[STIX]{x1D701}_{F}(s):=\mathop{\sum }_{n=1}^{\infty }{\displaystyle \frac{1}{F_{n}^{s}}},\quad \unicode[STIX]{x1D701}_{F}^{\ast }(s):=\mathop{\sum }_{n=1}^{\infty }{\displaystyle \frac{(-1)^{n+1}}{F_{n}^{s}}},\quad \unicode[STIX]{x1D701}_{L}(s):=\mathop{\sum }_{n=1}^{\infty }{\displaystyle \frac{1}{L_{n}^{s}}},\quad \unicode[STIX]{x1D701}_{L}^{\ast }(s):=\mathop{\sum }_{n=1}^{\infty }{\displaystyle \frac{(-1)^{n+1}}{L_{n}^{s}}}.\end{eqnarray}$$

$R(\unicode[STIX]{x1D70C}),Q(\unicode[STIX]{x1D70C}),$

$P(\unicode[STIX]{x1D70C})$

$\unicode[STIX]{x1D70C}$

$0<\unicode[STIX]{x1D70C}<1$

$s$

$m$

$$\begin{eqnarray}\mathop{\sum }_{s=1}^{m}(t_{s}\unicode[STIX]{x1D701}_{F}(2s)+u_{s}\unicode[STIX]{x1D701}_{F}^{\ast }(2s)+v_{s}\unicode[STIX]{x1D701}_{L}(2s)+w_{s}\unicode[STIX]{x1D701}_{L}^{\ast }(2s))=0\end{eqnarray}$$

$t_{s},u_{s},v_{s},w_{s}\in \mathbb{Q}$

$(1\leq s\leq m)$

$\mathbb{Q}$

$m$

$-2\unicode[STIX]{x1D701}_{F}(2)+\unicode[STIX]{x1D701}_{F}^{\ast }(2)+5\unicode[STIX]{x1D701}_{L}^{\ast }(2)=0$

$2s$

Using an idea of Doug Lind, we give a lower bound for the Perron–Frobenius degree of a Perron number that is not totally real, in terms of the layout of its Galois conjugates in the complex plane. As an application, we prove that there are cubic Perron numbers whose Perron–Frobenius degrees are arbitrary large, a result known to Lind, McMullen and Thurston. A similar result is proved for bi-Perron numbers.

In this paper, we study the set

$$\begin{eqnarray}A=\{p(n)+2^{n}d~\text{mod}~1:n\geq 1\}\subset [0,1],\end{eqnarray}$$

$p$

$d$

$a\in [0,\infty )$

$a~\text{mod}~1$

$a$

$A$