By examining two hypergeometric series transformations, we establish several remarkable infinite series identities involving harmonic numbers and quintic central binomial coefficients, including five conjectured recently by Z.-W. Sun [‘Series with summands involving harmonic numbers’, Preprint, 2023, arXiv:2210.07238v7]. This is realised by ‘the coefficient extraction method’ implemented by Mathematica commands.

Let $\mathcal {F}$ denote the set of functions $f \colon [-1/2,1/2] \to \mathbb {R}_{\geq 0}$ such that $\int f = 1$. We determine the value of $\inf _{f \in \mathcal {F}} \| f \ast f \|_2^2$ up to a $4 \cdot 10^{-6}$ error, thereby making progress on a problem asked by Ben Green. Furthermore, we prove that a unique minimizer exists. As a corollary, we obtain improvements on the maximum size of $B_h[g]$ sets for $(g,h) \in \{ (2,2),(3,2),(4,2),(1,3),(1,4)\}$.

We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting G be a countable discrete abelian group and $\phi _1, \phi _2, \phi _3: G \to G$ be commuting endomorphisms whose images have finite indices, we show that

1. (1) If $A \subset G$ has positive upper Banach density and $\phi _1 + \phi _2 + \phi _3 = 0$, then $\phi _1(A) + \phi _2(A) + \phi _3(A)$ contains a Bohr set. This generalizes a theorem of Bergelson and Ruzsa in $\mathbb {Z}$ and a recent result of the first author.

2. (2) For any partition $G = \bigcup _{i=1}^r A_i$, there exists an $i \in \{1, \ldots , r\}$ such that $\phi _1(A_i) + \phi _2(A_i) - \phi _2(A_i)$ contains a Bohr set. This generalizes a result of the second and third authors from $\mathbb {Z}$ to countable abelian groups.

3. (3) If $B, C \subset G$ have positive upper Banach density and $G = \bigcup _{i=1}^r A_i$ is a partition, $B + C + A_i$ contains a Bohr set for some $i \in \{1, \ldots , r\}$. This is a strengthening of a theorem of Bergelson, Furstenberg and Weiss.

All results are quantitative in the sense that the radius and rank of the Bohr set obtained depends only on the indices $[G:\phi _j(G)]$, the upper Banach density of A (in (1)), or the number of sets in the given partition (in (2) and (3)).

A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the series $f(A) = \sum _{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets A. In 1986, he asked if this bound is attained for the set of prime numbers. In this article, we answer in the affirmative.

As further applications of the method, we make progress towards a question of Erdős, Sárközy and Szemerédi from 1968. We also refine the classical Davenport–Erdős theorem on infinite divisibility chains, and extend a result of Erdős, Sárközy and Szemerédi from 1966.

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the $\alpha $-free words for rational $\alpha $, $2 < \alpha \leq 7/3$), is decidable. As a consequence, many results previously obtained about this class through tedious case-based proofs can now be proved “automatically,” using a decision procedure, and new claims can be proved or disproved simply by restating them as logical formulas.

The integrality of the numbers $A_{n,m}={(2n)!(2m)!}/{n!m!(n+m)!}$ was observed by Catalan as early as 1874 and Gessel named $A_{n,m}$ the super Catalan numbers. The positivity of the q-super Catalan numbers (q-analogue of the super Catalan numbers) was investigated by Warnaar and Zudilin [‘A q-rious positivity’, Aequationes Math. 81 (2011), 177–183]. We prove the divisibility of sums of q-super Catalan numbers, which establishes a q-analogue of Apagodu’s congruence involving super Catalan numbers.

Let $\varphi $ be Euler’s function and fix an integer $k\ge 0$. We show that for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi (x_n)+k$ for all $n\ge 1$ is eventually periodic. Similarly, for all initial values $x_1,x_2\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+2}=\varphi (x_{n+1})+\varphi (x_n)+k$ for all $n\ge 1$ is eventually periodic, provided that k is even.

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree d whose Galois group is $S_d$. Let $(a_n)$ be a non-degenerate linearly recursive sequence of integers which has P as its characteristic polynomial. We prove, under the generalised Riemann hypothesis, that the lower density of the set of primes which divide at least one non-zero element of the sequence $(a_n)$ is positive.

We establish analogues for trees of results relating the density of a set ${E \subset \mathbb {N}}$, the density of its set of popular differences and the structure of E. To obtain our results, we formalize a correspondence principle of Furstenberg and Weiss which relates combinatorial data on a tree to the dynamics of a Markov process. Our main tools are Kneser-type inverse theorems for sets of return times in measure-preserving systems. In the ergodic setting, we use a recent result of the first author with Björklund and Shkredov and a stability-type extension (proved jointly with Shkredov); we also prove a new result for non-ergodic systems.

Let a and b be positive integers and let $\{U_n\}_{n\ge 0}$ be the Lucas sequence of the first kind defined by

$$ \begin{align*}U_0=0,\quad U_1=1\quad \mbox{and} \quad U_n=aU_{n-1}+bU_{n-2} \quad \mbox{for }n\ge 2.\end{align*} $$

We define an $(a,b)$-Wall–Sun–Sun prime to be a prime p such that $\gcd (p,b)=1$ and $\pi (p^2)=\pi (p),$ where $\pi (p):=\pi _{(a,b)}(p)$ is the length of the period of $\{U_n\}_{n\ge 0}$ modulo p. When $(a,b)=(1,1)$, such primes are known in the literature simply as Wall–Sun–Sun primes. In this note, we provide necessary and sufficient conditions such that a prime p dividing $a^2+4b$ is an $(a,b)$-Wall–Sun–Sun prime.

We discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect numbers.

In this paper, the nilspace approach to higher-order Fourier analysis is developed in the setting of vector spaces over a prime field $\mathbb {F}_p$, with applications mainly in ergodic theory. A key requisite for this development is to identify a class of nilspaces adequate for this setting. We introduce such a class, whose members we call p-homogeneous nilspaces. One of our main results characterizes these objects in terms of a simple algebraic property. We then prove various further results on these nilspaces, leading to a structure theorem describing every finite p-homogeneous nilspace as the image, under a nilspace fibration, of a member of a simple family of filtered finite abelian p-groups. The applications include a description of the Host–Kra factors of ergodic $\mathbb {F}_p^\omega $-systems as p-homogeneous nilspace systems. This enables the analysis of these factors to be reduced to the study of such nilspace systems, with central questions on the factors thus becoming purely algebraic problems on finite nilspaces. We illustrate this approach by proving that for $k\leq p+1$ the kth Host–Kra factor is an Abramov system of order at most k, extending a result of Bergelson–Tao–Ziegler that holds for $k< p$. We illustrate the utility of p-homogeneous nilspaces also by showing that the structure theorem yields a new proof of the Tao–Ziegler inverse theorem for Gowers norms on $\mathbb {F}_p^n$.

Let $(x_n)_{n\geq 0}$ be a linear recurrence of order $k\geq 2$ satisfying $x_n=a_1x_{n-1}+a_2x_{n-2}+\cdots +a_kx_{n-k}$ for all integers $n\geq k$, where $a_1,\ldots ,a_k,x_0,\ldots , x_{k-1}\in \mathbb {Z},$ with $a_k\neq 0$. Sanna [‘The quotient set of k-generalised Fibonacci numbers is dense in $\mathbb {Q}_p$’, Bull. Aust. Math. Soc. 96(1) (2017), 24–29] posed the question of classifying primes p for which the quotient set of $(x_n)_{n\geq 0}$ is dense in $\mathbb {Q}_p$. We find a sufficient condition for denseness of the quotient set of the kth-order linear recurrence $(x_n)_{n\geq 0}$ satisfying $ x_{n}=a_1x_{n-1}+a_2x_{n-2}+\cdots +a_kx_{n-k}$ for all integers $n\geq k$ with initial values $x_0=\cdots =x_{k-2}=0,x_{k-1}=1$, where $a_1,\ldots ,a_k\in \mathbb {Z}$ and $a_k=1$. We show that, given a prime p, there are infinitely many recurrence sequences of order $k\geq 2$ whose quotient sets are not dense in $\mathbb {Q}_p$. We also study the quotient sets of linear recurrence sequences with coefficients in certain arithmetic and geometric progressions.

Open conjectures state that, for every $x\in [0,1]$, the orbit $(x_n)_{n=1}^\infty $ of the mean-median recursion

$$ \begin{align*}x_{n+1}=(n+1)\cdot\operatorname{\mathrm{median}}(x_1,\ldots,x_{n})-(x_1+\cdots+x_n),\quad n\geqslant 3,\end{align*} $$

with initial data $(x_1,x_2,x_3)=(0,x,1)$, is eventually constant, and that its transit time and limit functions (of x) are unbounded and continuous, respectively. In this paper, we prove that for the slightly modified recursion

$$ \begin{align*}x_{n+1}=n\cdot\operatorname{\mathrm{median}}(x_1,\ldots,x_{n})-(x_1+\cdots+x_n),\quad n\geqslant 3,\end{align*} $$

first suggested by Akiyama, the transit time function is unbounded but the limit function is discontinuous.

Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta (n^{1/4})$. We study the analogous problem in the $\mathbb {Z}_n$ setting. We asymptotically determine the logarithm of the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for all positive integer $n$. We further determine up to a constant factor the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ for many $n$. For example, if $n=p^k$ is a prime power, then the discrepancy of arithmetic progressions in $\mathbb {Z}_n$ is $\Theta (n^{1/3+r_k/(6k)})$, where $r_k \in \{0,1,2\}$ is the remainder when $k$ is divided by $3$. This solves a problem of Hebbinghaus and Srivastav.

Let $h \geq 2$ be a positive integer. We introduce the concept of minimal restricted asymptotic bases and obtain some examples of minimal restricted asymptotic bases of order h.

Motivated by near-identical graphs of two increasing continuous functions—one related to Zaremba’s conjecture and the other due to Salem—we provide an explicit connection between fractals and regular sequences by showing that the graphs of ghost distributions, the distribution functions of measures associated to regular sequences, are sections of self-affine sets. Additionally, we provide a sufficient condition for such measures to be purely singular continuous. As a corollary, and analogous to Salem’s strictly increasing singular continuous function, we show that the ghost distributions of the Zaremba sequences are singular continuous.

Let $\mathcal {A}$ be the set of all integers of the form $\gcd (n, F_n)$, where n is a positive integer and $F_n$ denotes the nth Fibonacci number. Leonetti and Sanna proved that $\mathcal {A}$ has natural density equal to zero, and asked for a more precise upper bound. We prove that

$$ \begin{align*} \#\big(\mathcal{A} \cap [1, x]\big) \ll \frac{x \log \log \log x}{\log \log x} \end{align*} $$

A Sidon set is a subset of an Abelian group with the property that the sums of two distinct elements are distinct. We relate the Sidon sets constructed by Bose to affine subspaces of $ \mathbb {F} _ {q ^ 2} $ of dimension one. We define Sidon arrays which are combinatorial objects giving a partition of the group $\mathbb {Z}_{q ^ 2} $ as a union of Sidon sets. We also use linear recurring sequences to quickly obtain Bose-type Sidon sets without the need to use the discrete logarithm.

We show that if $\mathcal {A}\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in \mathcal {A}$ and $n\geq 1$, then

\[ \lvert \mathcal{A}\rvert \ll \frac{N}{(\log N)^{c\log\log \log N}} \]

$c>0$