For any integer $t \geq 2$, we prove a local limit theorem (LLT) with an explicit convergence rate for the number of parts in a uniformly chosen t-regular partition. When $t = 2$, this recovers the LLT for partitions into distinct parts, as previously established in the work of Szekeres [‘Asymptotic distributions of the number and size of parts in unequal partitions’, Bull. Aust. Math. Soc. 36 (1987), 89–97].

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.

We investigate semigroups S which have the property that every subsemigroup of $S\times S$ which contains the diagonal $\{ (s,s)\colon s\in S\}$ is necessarily a congruence on S. We call such an S a DSC semigroup. It is well known that all finite groups are DSC, and easy to see that every DSC semigroup must be simple. Building on this, we show that for broad classes of semigroups, including periodic, stable, inverse and several well-known types of simple semigroups, the only DSC members are groups. However, it turns out that there exist nongroup DSC semigroups, which we obtain by utilising a construction introduced by Byleen for the purpose of constructing interesting congruence-free semigroups. Such examples can additionally be regular or bisimple.

Brun’s constant is the summation of the reciprocals of all twin primes, given by

$$ \begin{align*}B=\sum_{p \in P_2}{\bigg( \frac{1}{p} + \frac{1}{p+2}\bigg)}.\end{align*} $$

While rigorous unconditional bounds on B are known, we present the first rigorous bound on Brun’s constant under the assumption of GRH, yielding $B < 2.1594$.

We strengthen two results of Moretó. We prove that the index of the Fitting subgroup is bounded in terms of the degrees of the irreducible monomial Brauer characters of the finite solvable group G and it is also bounded in terms of the average degree of the irreducible Brauer characters of G that lie over a linear character of the Fitting subgroup.

Let g be an element of a group G. For a positive integer n, let $R_n(g)$ be the subgroup generated by all commutators $[\ldots [[g,x],x],\ldots ,x]$ over $x\in G$, where x is repeated n times. Similarly, $L_n(g)$ is defined as the subgroup generated by all commutators $[\ldots [[x,g],g],\ldots ,g]$, where $x\in G$ and g is repeated n times. In the literature, there are several results showing that certain properties of groups with small subgroups $R_n(g)$ or $L_n(g)$ are close to those of Engel groups. The present article deals with orderable groups in which, for some $n\geq 1$, the subgroups $R_n(g)$ are polycyclic. Let $h\geq 0$, $n>0$ be integers and G be an orderable group in which $R_n(g)$ is polycyclic with Hirsch length at most h for every $g\in G$. It is proved that there are $(h,n)$-bounded numbers $h^*$ and $c^*$ such that G has a finitely generated normal nilpotent subgroup N with $h(N)\leq h^*$ and $G/N$ nilpotent of class at most $c^*$. The analogue of this theorem for $L_n(g)$ was established in 2018 by Shumyatsky [‘Orderable groups with Engel-like conditions’, J. Algebra 499 (2018), 313–320].

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.

For a group G, a subgroup $U \leqslant G$ and a group A such that $\mathrm {Inn}(G) \leqslant A \leqslant \mathrm {Aut}(G)$, we say that U is an A-covering group of G if $G = \bigcup _{a\in A}U^a$. A theorem of Jordan (1872), implies that if G is a finite group, $A = \mathrm {Inn}(G)$ and U is an A-covering group of G, then $U = G$. Motivated by a question concerning Kronecker classes of field extensions, Neumann and Praeger (1990) conjectured that, more generally, there is an integer function f such that if G is a finite group and U is an A-covering subgroup of G, then $|G:U| \leqslant f(|A:\mathrm {Inn}(G)|)$. A key piece of evidence for this conjecture is a theorem of Praeger [‘Kronecker classes of fields and covering subgroups of finite groups’, J. Aust. Math. Soc. 57 (1994), 17–34], which asserts that there is a two-variable integer function g such that if G is a finite group and U is an A-covering subgroup of G, then $|G:U|\leqslant g(|A:\mathrm {Inn}(G)|,c)$, where c is the number of A-chief factors of G. Unfortunately, the proof of this theorem contains an error. In this paper, using a different argument, we give a correct proof of the theorem.

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.

We propose a generalised version of configuration spaces defined by disallowing combinations of simultaneous collisions among the n points determined by a family of forbidden partitions. In the case where the underlying space is a finite graph, we construct a cubical complex with the same homology as this configuration space.

We give a simplified version of the proofs that, outside of their isolated vertices, the complement of the enhanced power graph and of the power graph are connected and have diameter at most $3$.

H. H. Chan, K. S. Chua and P. Solé [‘Quadratic iterations to $\pi $ associated to elliptic functions to the cubic and septic base’, Trans. Amer. Math. Soc. 355(4) (2002), 1505–1520] found that, for each positive integer d, there are theta series $A_d, B_d$ and $C_d$ of weight one that satisfy the Pythagoras-like relationship $A_d^2=B_d^2+C_d^2$. In this article, we show that there are two collections of theta series $A_{b,d}, B_{b,d}$ and $C_{b,d}$ of weight one that satisfy $A_{b,d}^2=B_{b,d}^2+C_{b,d}^2,$ where b and d are certain integers.

We compute primes $p \equiv 5 \bmod 8$ up to $10^{11}$ for which the Pellian equation $x^2-py^2=-4$ has no solutions in odd integers; these are the members of sequence A130229 in the Online Encyclopedia of Integer Sequences. We find that the number of such primes $p\leqslant x$ is well approximated by

$$ \begin{align*}\frac{1}{12}\pi(x) - 0.037\int_2^x \frac{dt}{t^{1/6}\log t},\end{align*} $$

where $\pi (x)$ is the usual prime counting function. The second term shows a surprising bias away from membership of this sequence.

We consider the relationship between the Mahler measure $M(f)$ of a polynomial f and its separation $\operatorname {sep}(f)$. Mahler [‘An inequality for the discriminant of a polynomial’, Michigan Math. J. 11 (1964), 257–262] proved that if $f(x) \in \mathbb {Z}[x]$ is separable of degree n, then $\operatorname {sep}(f) \gg _n M(f)^{-(n-1)}$. This spurred further investigations into the implicit constant involved in that relationship and led to questions about the optimal exponent on $M(f)$. However, there has been relatively little study concerning upper bounds on $\operatorname {sep}(f)$ in terms of $M(f)$. We prove that if $f(x) \in \mathbb {C}[x]$ has degree n, then $\operatorname {sep}(f) \ll n^{-1/2}M(f)^{1/(n-1)}$. Moreover, this bound is sharp up to the implied constant factor. We further investigate the constant factor under various additional assumptions on $f(x)$; for example, if it has only real roots.

Let $E/\mathbb {Q}(T)$ be a nonisotrivial elliptic curve of rank r. A theorem due to Silverman [‘Heights and the specialization map for families of abelian varieties’, J. reine angew. Math. 342 (1983), 197–211] implies that the rank $r_t$ of the specialisation $E_t/\mathbb {Q}$ is at least r for all but finitely many $t \in \mathbb {Q}$. Moreover, it is conjectured that $r_t \leq r+2$, except for a set of density $0$. When $E/\mathbb {Q}(T)$ has a torsion point of order $2$, under an assumption on the discriminant of a Weierstrass equation for $E/\mathbb {Q}(T)$, we produce an upper bound for $r_t$ that is valid for infinitely many t. We also present two examples of nonisotrivial elliptic curves $E/\mathbb {Q}(T)$ such that $r_t \leq r+1$ for infinitely many t.

We investigate neighbourhood sizes in the enhanced power graph (also known as the cyclic graph) associated with a finite group. In particular, we characterise finite p-groups with the smallest maximum size for neighbourhoods of a nontrivial element in its enhanced power graph.

Let $\mathbb {F}$ be a field and $(s_0,\ldots ,s_{n-1})$ be a finite sequence of elements of $\mathbb {F}$. In an earlier paper [G. H. Norton, ‘On the annihilator ideal of an inverse form’, J. Appl. Algebra Engrg. Comm. Comput. 28 (2017), 31–78], we used the $\mathbb {F}[x,z]$ submodule $\mathbb {F}[x^{-1},z^{-1}]$ of Macaulay’s inverse system $\mathbb {F}[[x^{-1},z^{-1}]]$ (where z is our homogenising variable) to construct generating forms for the (homogeneous) annihilator ideal of $(s_0,\ldots ,s_{n-1})$. We also gave an $\mathcal {O}(n^2)$ algorithm to compute a special pair of generating forms of such an annihilator ideal. Here we apply this approach to the sequence r of the title. We obtain special forms generating the annihilator ideal for $(r_0,\ldots ,r_{n-1})$ without polynomial multiplication or division, so that the algorithm becomes linear. In particular, we obtain its linear complexities. We also give additional applications of this approach.

Let n be a positive integer and $\underline {n}=\{1,2,\ldots ,n\}$. A conjecture arising from certain polynomial near-ring codes states that if $k\geq 1$ and $a_{1},a_{2},\ldots ,a_{k}$ are distinct positive integers, then the symmetric difference $a_{1}\underline {n}\mathbin {\Delta }a_{2}\underline {n}\mathbin {\Delta }\cdots \mathbin {\Delta }a_{k}\underline {n}$ contains at least n elements. Here, $a_{i}\underline {n}=\{a_{i},2a_{i},\ldots ,na_{i}\}$ for each i. We prove this conjecture for arbitrary n and for $k=1,2,3$.

Let n be a nonzero integer. A set S of positive integers is a Diophantine tuple with the property $D(n)$ if $ab+n$ is a perfect square for each $a,b \in S$ with $a \neq b$. It is of special interest to estimate the quantity $M_n$, the maximum size of a Diophantine tuple with the property $D(n)$. We show the contribution of intermediate elements is $O(\log \log |n|)$, improving a result by Dujella [‘Bounds for the size of sets with the property $D(n)$’, Glas. Mat. Ser. III 39(59)(2) (2004), 199–205]. As a consequence, we deduce that $M_n\leq (2+o(1))\log |n|$, improving the best known upper bound on $M_n$ by Becker and Murty [‘Diophantine m-tuples with the property $D(n)$’, Glas. Mat. Ser. III 54(74)(1) (2019), 65–75].

Let $\alpha $ be a complex valued $2$-cocycle of finite order of a finite group $G.$ The nth Frobenius–Schur indicator of an irreducible $\alpha $-character of G is defined and its properties are investigated. The indicator is interpreted in general for $n =2$ and it is shown that it can be used to determine whether an irreducible $\alpha $-character is real-valued under the assumption that the order of $\alpha $ and its cohomology class are both $2$. A formula, involving the real $\alpha $-regular conjugacy classes of $G,$ is found to count the number of real-valued irreducible $\alpha $-characters of G under the additional assumption that these characters are class functions.