The set of sums of two squares plays a significant role in number theory. We establish the existence of several rich monochromatic configurations in the natural numbers by exploiting algebraic structures induced by the set of sums of two squares. The proofs rely on algebraic properties arising from the induced structures on the Stone–Čech compactification of the natural numbers.

The lattice walks in the plane starting at the origin $\mathbf {0}$ with steps in $\{-1,0,1\}^{2}\setminus \{\mathbf {0}\}$ are called king walks. We investigate enumeration and divisibility for higher dimensional king walks confined to certain regions. Specifically, we establish an explicit formula for the number of $(r+s)$-dimensional king walks of length n ending at $(a_1,\ldots ,a_r,b_1,\ldots ,b_s)$ which never dip below $x_i=0$ for $i=1,\ldots ,r$. We also derive divisibility properties for the number of $(r+s)$-dimensional king walks of length p (an odd prime) through group actions.

If G is a graph, then $X\subseteq V(G)$ is a general position set if for every two vertices $v,u\in X$ and every shortest $(u,v)$-path P, no inner vertex of P lies in X. We propose three algorithms to compute a largest general position set in G: an integer linear programming algorithm, a genetic algorithm and a simulated annealing algorithm. These approaches are supported by examples from different areas of graph theory.

For an integer $m>1$, we denote by $P(m)$ the largest prime divisor of m. We improve a result of Stewart [‘On the greatest and least prime factors of ${n!}+1$, II’, Publ. Math. Debrecen 65(3–4) (2004), 461–480] by showing that $\limsup _{n \rightarrow \infty } P({n!}+1)/n \geqslant 1+9\log 2$. More generally, for any nonzero polynomial $f(X)$ with integer coefficients, we show that $\limsup _{n \rightarrow \infty } P({n!}+f(n))/n \geqslant 1+9\log 2$. This improves a result of Luca and Shparlinski [‘Prime divisors of shifted factorials’, Bull. Lond. Math. Soc. 37(6) (2005), 809–817]. These improvements stem from an additional combinatorial idea that builds upon the works mentioned above.

A fundamental extremality result due to Sidorenko [‘A partially ordered set of functionals corresponding to graphs’, Discrete Math. 131(1–3) (1994), 263–277] states that among all connected graphs G on k vertices, the k-vertex star maximises the number of graph homomorphisms of G into any graph H. We provide a new short proof of this result using only a simple recursive counting argument for trees and Hölder’s inequality.

This paper is motivated by two conjectures proposed by Bender et al. [‘Complemented zero-divisor graphs associated with finite commutative semigroups’, Comm. Algebra 52(7) (2024), 2852–2867], which have remained open questions. The first conjecture states that if the complemented zero-divisor graph $ G(S) $ of a commutative semigroup $ S $ with a zero element has clique number three or greater, then the reduced graph $ G_r(S) $ is isomorphic to the graph $ G(\mathcal {P}(n)) $. The second conjecture asserts that if $ G(S) $ is a complemented zero-divisor graph with clique number three or greater, then $ G(S) $ is uniquely complemented. We construct a commutative semigroup $ S $ with a zero element that serves as a counter-example to both conjectures.

We provide numerical evidence towards three conjectures on harmonic numbers by Eswarathasan, Levine and Boyd. Let $J_p$ denote the set of integers $n\geq 1$ such that the harmonic number $H_n$ is divisible by a prime p. The conjectures state that: (i) $J_p$ is always finite and of the order $O(p^2(\log \log p)^{2+\epsilon })$; (ii) the set of primes for which $J_p$ is minimal (called harmonic primes) has density $e^{-1}$ among all primes; (iii) no harmonic number is divisible by $p^4$. We prove parts (i) and (iii) for all $p\leq 16843$ with at most one exception, and enumerate harmonic primes up to $50\times 10^5$, finding a proportion close to the expected density. Our work extends previous computations by Boyd by a factor of approximately $30$ and $50$, respectively.

Given two graphs G and H, the Ramsey number $R(G,H)$ is the smallest positive integer N such that every graph of order N contains G or its complement contains H as a subgraph. Let $C_n$ denote the cycle on n vertices and let $tW_{2m+1}$ denote the disjoint union of t copies of the $(2m+2)$-vertex wheel $W_{2m+1}$. We show that for integers $m\ge 1$, $t\ge 2$ and $n\ge (6m+3)t-6m+999$,

$$ \begin{align*} R(C_n, tW_{2m+1})=3n+t-3. \end{align*} $$

This result extends several previous results and settles a conjecture posed by Sudarsana [‘A note on the Ramsey number for cycle with respect to multiple copies of wheels’, Electron. J. Graph Theory Appl. 9(2) (2021), 561–566].

Recently, there has been a large number of works on bilinear sums with Kloosterman sums and on sums of Kloosterman sums twisted by arithmetic functions. Motivated by these, we consider several related new questions about sums of Kloosterman sums parametrised by square-free and smooth integers. Some of our results are presented in the much more general setting of trace functions.

Andrews and El Bachraoui [‘On two-color partitions with odd smallest part’, Preprint (2024), arXiv:2410. 14190] recently investigated identities involving two-colour partitions, with particular emphasis on their connection to overpartitions, and posed questions regarding possible companion results. Subsequently, Chen and Zou [‘Combinatorial proofs for two-colour partitions’, Bull. Aust. Math. Soc. 113(1) (2025), to appear] obtained some companion results by employing q-series identities and generating functions. In addition, they presented a combinatorial proof for one of their own results and one of the results of Andrews and El Bachraoui. They posed questions regarding combinatorial proofs of the remaining companion results. In this paper, we provide such proofs.

Let A be a set of natural numbers. A set B of natural numbers is an additive complement of the set A if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. We establish that if $A=\{a_i: i\in \mathbb {N}\}$ is a set of natural numbers such that $a_i<a_{i+1} $ for $i \in \mathbb {N}$ and $\liminf _{n\rightarrow \infty } (a_{n+1}/a_{n})>1$, then there exists a set $B\subset \mathbb {N}$ such that $B\cap A = \varnothing $ and B is a sparse additive complement of the set A.

Let p be a fixed odd prime. We prove the following results for positive integer solutions $(x,m,n)$ of the equation $(*)\ x^2=2^m+p^n$. (i) If $p \equiv 3 \pmod 8$, then $(*)$ has only the solution $(p,x,m,n)=(3,5,4,2)$. (ii) If $p \equiv 5 \pmod 8$, then $(*)$ has only the solution $(p,x,m,n)=(5,3,2,1)$. (iii) If $p \equiv 7 \pmod 8$, then $(*)$ has at most one solution $(x,m,n)$, except for $p=7$, $(x,m,n)=(3,1,1)$ and $(9,5,2)$. Moreover, if $p=2^q-1$ is a Mersenne prime with $p>7$, where q is an odd prime with $q>3$, then $(*)$ has exactly one solution $(x,m,n)=(2^q+1,q+2,2)$. If $p \equiv 7\pmod 8$, p is not a Mersenne prime and either $p<1.5\times 10^{12}$ or $p>C$, where C is an effectively computable absolute constant, then $(*)$ has only the solutions $p=a^2-2$, where a is an odd positive integer, $(x,m,n)=(a,1,1)$. (iv) If $p \equiv 1\pmod 8$ with $p \ne 17$, then $(*)$ has at most two solutions $(x,m,n)$.

The paperfolding sequences form an uncountable class of infinite sequences over the alphabet $\{ -1, 1 \}$ that describe the sequence of folds arising from iterated folding of a piece of paper, followed by unfolding. In this note, we observe that the sequence of run lengths in such a sequence, as well as the starting and ending positions of the nth run, is $2$-synchronised and hence computable by a finite automaton. As a specific consequence, we obtain the recent results of Bunder, Bates and Arnold [‘The summed paperfolding sequence’, Bull. Aust. Math. Soc. 110 (2024), 189–198] in much more generality, via a different approach. We also prove results about the critical exponent and subword complexity of these run-length sequences.

A square-full number is a positive integer for which all prime divisors divide the number at least twice. For a relatively prime pair $(a,b)\in \mathbb N\times \mathbb N\cup \{0\}$ and an affine polynomial $f(x)=ax+b$, the number of $n\leqslant N$ such that $f(n)$ is square-full is of order $N^{{1}/{2}}$. For $\varepsilon>0$ and an admissible quadratic polynomial $f(x)\in \mathbb Z[x]$, we show that the number of $n\leqslant N$ such that $f(n)$ is square-full is at most $O_{\varepsilon ,f}(N^{\varpi +\varepsilon })$ for some absolute constant $\varpi <1/2$. Under the $abc$ conjecture, we expect the upper bound to be $O_{\varepsilon ,f}(N^\varepsilon )$.

Let F be a totally real field. Let $\mathsf {A}$ be a simple modular self-dual abelian variety defined over F. We study the growth of the corank of Selmer groups of $\mathsf {A}$ over $\mathbb {Z}_p$-extensions of a complex multiplication (CM) extension of F. We propose an extension of Mazur’s growth number conjecture for elliptic curves to this new setting. We provide evidence supporting an affirmative answer by studying special cases of this problem, generalising previous results on elliptic curves and imaginary quadratic fields.

For any integers x and y, let $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of x and y, respectively. Let $a,b$ and n be positive integers, and let $S=\{x_1, \ldots , x_n\}$ be a set of n distinct positive integers. We denote by $(S^a)$ and $[S^a]$ the $n\times n$ matrices having the ath power of $(x_i,x_j)$ and $[x_i,x_j]$, respectively, as the $(i,j)$-entry. Bourque and Ligh [‘On GCD and LCM matrices’, Linear Algebra Appl. 174 (1992), 65–74] showed that if S is factor closed (that is, S contains all positive divisors of any element of S), then the GCD matrix $(S)$ divides the LCM matrix $[S]$ (written as $(S)\mid [S]$) in the ring $M_n({\mathbb Z})$ of $n\times n$ matrices over the integers. Hong [‘Divisibility properties of power GCD matrices and power LCM matrices’, Linear Algebra Appl. 428 (2008), 1001–1008] proved that $(S^a)\mid (S^b)$, $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$ when $a\mid b$ and S is a divisor chain (namely, there is a permutation $\sigma $ of order n such that $x_{\sigma (1)}\mid \cdots \mid x_{\sigma (n)}$). In this paper, we show that if $a\mid b$ and S is factor closed, then $(S^a)\mid (S^b)$, $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$. The proof is algebraic and p-adic. Our result extends the Bourque–Ligh theorem. Finally, several interesting conjectures are proposed.

Bergelson and Richter [‘Dynamical generalizations of the prime number theorem and disjointness of additive and multiplicative semigroup actions’, Duke Math. J. 171(15) (2022), 3133–3200] established a new dynamical generalisation of the prime number theorem (PNT) and the PNT for arithmetic progressions. Let $h\ge 1, k\ge 2$. Mirsky [‘Note on an asymptotic formula connected with r-free integers’, Quart. J. Math. Oxford Ser. 18 (1947), 178–182] showed that the numbers n such that $n+l_1,\ldots , n+l_h$ are k-free have a natural density for any given nonnegative integers $l_1,\ldots , l_h$. In this note, we show that the Bergelson–Richter theorem holds for the numbers studied by Mirsky.

This paper studies the $4$-ranks of narrow class groups in certain families of quadratic fields. We prove that for any positive integer n, there exists an integer $s_\lambda (n)$ depending on n and the sign $\lambda $ of the fundamental discriminant D, such that for any choice of $s_\lambda (n)$ integers $t_1, \ldots , t_{s_\lambda (n)}$, there are infinitely many D for which the narrow class group of $\mathbb {Q}(\sqrt {D + t_i})$ has $4$-rank bounded by n for all i. This result extends previous work on $3$-ranks to the case of $4$-ranks.

Andrews and El Bachraoui [‘On two-colour partitions with odd smallest part’, Preprint, arXiv:2410.14190] explored many integer partitions in two colours, some of which are generated by the mock theta functions of third order of Ramanujan and Watson. They also posed questions regarding combinatorial proofs for these results. In this paper, we establish bijections to provide a combinatorial proof of one of these results and a companion result. We give analytic proofs of further companion results.

In this paper, we generalise to the family of Fermat quartics $X^4 + Y^4 = 2^m, m \in \mathbb {Z}$, a result of Aigner [‘Über die Möglichkeit von $x^4 + y^4 = z^4$ in quadratischen Körpern’, Jahresber. Deutsch. Math.-Ver. 43 (1934), 226–228], which proves that there is only one quadratic field, namely $\mathbb {Q}(\sqrt {-7})$, that contains solutions to the Fermat quartic $X^4 + Y^4 = 1$. The $m \equiv 0 \pmod 4$ case is due to Aigner. The $m \equiv 2 \pmod 4$ case follows from a result of Emory [‘The Diophantine equation $X^4 + Y^4 = D^2Z^4$ in quadratic fields’, Integers 12 (2012), Article no. A65, 8 pages]. This paper focuses on the two cases $m \equiv 1, 3 \pmod 4$, classifying for $m \equiv 1 \pmod 4$ the infinitely many quadratic number fields that contain solutions, and proving for $m \equiv 3 \pmod 4$ that $\mathbb {Q}(\sqrt {2})$ and $\mathbb {Q}(\sqrt {-2})$ are the only quadratic number fields that contain solutions.