We give a sufficient and necessary condition for a Praeger–Xu graph to be a Cayley graph.

We demonstrate that every difference set in a finite Abelian group is equivalent to a certain ‘regular’ covering of the lattice $ A_n = \{ \boldsymbol {x} \in \mathbb {Z} ^{n+1} : \sum _{i} x_i = 0 \} $ with balls of radius $ 2 $ under the $ \ell _1 $ metric (or, equivalently, a covering of the integer lattice $ \mathbb {Z} ^n $ with balls of radius $ 1 $ under a slightly different metric). For planar difference sets, the covering is also a packing, and therefore a tiling, of $ A_n $ . This observation leads to a geometric reformulation of the prime power conjecture and of other statements involving Abelian difference sets.

Let p be a prime with $p\equiv 1\pmod {4}$ . Gauss first proved that $2$ is a quartic residue modulo p if and only if $p=x^2+64y^2$ for some $x,y\in \Bbb Z$ and various expressions for the quartic residue symbol $(\frac {2}{p})_4$ are known. We give a new characterisation via a permutation, the sign of which is determined by $(\frac {2}{p})_4$ . The permutation is induced by the rule $x \mapsto y-x$ on the $(p-1)/4$ solutions $(x,y)$ to $x^2+y^2\equiv 0 \pmod {p}$ satisfying $1\leq x < y \leq (p-1)/2$ .

The $\chi $ -stability index $\mathrm {es}_{\chi }(G)$ of a graph G is the minimum number of its edges whose removal results in a graph with chromatic number smaller than that of G. We consider three open problems from Akbari et al. [‘Nordhaus–Gaddum and other bounds for the chromatic edge-stability number’, European J. Combin. 84 (2020), Article no. 103042]. We show by examples that a known characterisation of k-regular ( $k\le 5$ ) graphs G with $\mathrm {es}_{\chi }(G) = 1$ does not extend to $k\ge 6$ , and we characterise graphs G with $\chi (G)=3$ for which $\mathrm { es}_{\chi }(G)+\mathrm {es}_{\chi }(\overline {G}) = 2$ . We derive necessary conditions on graphs G which attain a known upper bound on $\mathrm { es}_{\chi }(G)$ in terms of the order and the chromatic number of G and show that the conditions are sufficient when $n\equiv 2 \pmod 3$ and $\chi (G)=3$ .

When a page, represented by the interval $[0,1],$ is folded right over left $ n$ times, the right-hand fold contains a sequence of points. We specify these points and the order in which they appear in each fold. We also determine exactly where in the folded structure any point in $[0,1]$ appears and, given any point on the bottom line of the structure, which point lies at each level above it.

An oriented graph is called singular or nonsingular according as its adjacency matrix is singular or nonsingular. In this note, by a new approach, we determine the singularity of oriented quasi-trees. The main results of Chen et al. [‘Singularity of oriented graphs from several classes’, Bull. Aust. Math. Soc. 102(1) (2020), 7–14] follow as corollaries. Furthermore, we give a necessary condition for an oriented bipartite graph to be nonsingular. By applying this condition, we characterise nonsingular oriented bipartite graphs $B_{m,n}$ when $\min \{m,n\}\leq 3$ .

A graph G is called a $(P_{\geq n},k)$ -factor-critical covered graph if for any $Q\subseteq V(G)$ with $|Q|=k$ and any $e\in E(G-Q)$ , $G-Q$ has a $P_{\geq n}$ -factor covering e. We demonstrate that (i) a $(k+1)$ -connected graph G with at least $k+3$ vertices is a $(P_{\geq 3},k)$ -factor-critical covered graph if its toughness $t(G)>{(2+k)}/{3}$ ; (ii) a $(k+2)$ -connected graph G is a $(P_{\geq 3},k)$ -factor-critical covered graph if its isolated toughness $I(G)>{(5+k)}/{3}$ . Furthermore, we show that the conditions on $t(G)$ and $I(G)$ are sharp.

We generalise two quartic surfaces studied by Swinnerton-Dyer to give two infinite families of diagonal quartic surfaces which violate the Hasse principle. Standard calculations of Brauer–Manin obstructions are exhibited.

When a page, represented by the interval $[0,1]$ , is folded right over left $n $ times, the right-hand fold contains a sequence of points. We specify these points using two different representation techniques, both involving binary signed-digit representations.

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 develop some asymptotics for a kernel function introduced by Kohnen and use them to estimate the number of normalised Hecke eigenforms in $S_k(\Gamma _0(1))$ whose L-values are simultaneously nonvanishing at a given pair of points each of which lies inside the critical strip.

We prove a divisibility result on sums involving the Apéry-like polynomials

$$ \begin{align*} V_n(x)=\sum_{k=0}^n {n\choose k}{n+k\choose k}{x\choose k}{x+k\choose k}, \end{align*} $$

which confirms a conjectural congruence of Z.-H. Sun. Our proof relies on some combinatorial identities and transformation formulae.

The aim of this article is to establish the behaviour of partial Euler products for Dirichlet L-functions under the generalised Riemann hypothesis (GRH) via Ramanujan’s work. To understand the behaviour of Euler products on the critical line, we invoke the deep Riemann hypothesis (DRH). This work clarifies the relation between GRH and DRH.

Let $k\geq 2$ be an integer. We prove that the 2-automatic sequence of odious numbers $\mathcal {O}$ is a k-additive uniqueness set for multiplicative functions: if a multiplicative function f satisfies a multivariate Cauchy’s functional equation $f(x_1+x_2+\cdots +x_k)=f(x_1)+f(x_2)+\cdots +f(x_k)$ for arbitrary $x_1,\ldots ,x_k\in \mathcal {O}$ , then f is the identity function $f(n)=n$ for all $n\in \mathbb {N}$ .

By combining the generating function approach with the Lagrange expansion formula, we evaluate, in closed form, two multiple alternating sums of binomial coefficients, which can be regarded as alternating counterparts of the circular sum evaluation discovered by Carlitz [‘The characteristic polynomial of a certain matrix of binomial coefficients’, Fibonacci Quart. 3(2) (1965), 81–89].

In 1946, Erdős and Niven proved that no two partial sums of the harmonic series can be equal. We present a generalisation of the Erdős–Niven theorem by showing that no two partial sums of the series $\sum _{k=0}^\infty {1}/{(a+bk)}$ can be equal, where a and b are positive integers. The proof of our result uses analytic and p-adic methods.

Let $p_{\{3, 3\}}(n)$ denote the number of $3$ -regular partitions in three colours. Da Silva and Sellers [‘Arithmetic properties of 3-regular partitions in three colours’, Bull. Aust. Math. Soc. 104(3) (2021), 415–423] conjectured four Ramanujan-like congruences modulo $5$ satisfied by $p_{\{3, 3\}}(n)$ . We confirm these conjectural congruences using the theory of modular forms.

We show that the system of equations

$$ \begin{align*} \sum_{i=1}^{s} (x_{i}^{\,j}-y_{i}^{\,j}) = a_{j} \quad (1 \leqslant j \leqslant k) \end{align*} $$

has appreciably fewer solutions in the subcritical range $s < \tfrac 12k(k+1)$ than its homogeneous counterpart, provided that $a_{\ell } \neq 0$ for some $\ell \leqslant k-1$ . Our methods use Vinogradov’s mean value theorem in combination with a shifting argument.

Let $\mathbb {N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb {N}$ and $n\in \mathbb {N}$ , let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$ , $s_1,s_2\in S$ and $s_1<s_2$ . Let A be the set of all nonnegative integers which contain an even number of digits $1$ in their binary representations and $B=\mathbb {N}\setminus A$ . Put $A_l=A\cap [0,2^l-1]$ and $B_l=B\cap [0,2^l-1]$ . We prove that if $C \cup D=[0, m]\setminus \{r\}$ with $0<r<m$ , $C \cap D=\emptyset $ and $0 \in C$ , then $R_{C}(n)=R_{D}(n)$ for any nonnegative integer n if and only if there exists an integer $l \geq 1$ such that $m=2^{l}$ , $r=2^{l-1}$ , $C=A_{l-1} \cup (2^{l-1}+1+B_{l-1})$ and $D=B_{l-1} \cup (2^{l-1}+1+A_{l-1})$ . Kiss and Sándor [‘Partitions of the set of nonnegative integers with the same representation functions’, Discrete Math. 340 (2017), 1154–1161] proved an analogous result when $C\cup D=[0,m]$ , $0\in C$ and $C\cap D=\{r\}$ .

Let F be a system of polynomial equations in one or more variables with integer coefficients. We show that there exists a univariate polynomial $D \in \mathbb {Z}[x]$ such that F is solvable modulo p if and only if the equation $D(x) \equiv 0 \pmod {p}$ has a solution.