A colouring of the vertices of a regular polygon is symmetric if it is invariant under some reflection of the polygon. We count the number of symmetric $r$-colourings of the vertices of a regular $n$-gon.

Let $m$, $a$, $c$ be positive integers with $a\equiv 3, 5~({\rm mod} \hspace{0.334em} 8)$. We show that when $1+ c= {a}^{2} $, the exponential Diophantine equation $\mathop{({m}^{2} + 1)}\nolimits ^{x} + \mathop{(c{m}^{2} - 1)}\nolimits ^{y} = \mathop{(am)}\nolimits ^{z} $ has only the positive integer solution $(x, y, z)= (1, 1, 2)$ under the condition $m\equiv \pm 1~({\rm mod} \hspace{0.334em} a)$, except for the case $(m, a, c)= (1, 3, 8)$, where there are only two solutions: $(x, y, z)= (1, 1, 2), ~(5, 2, 4). $ In particular, when $a= 3$, the equation $\mathop{({m}^{2} + 1)}\nolimits ^{x} + \mathop{(8{m}^{2} - 1)}\nolimits ^{y} = \mathop{(3m)}\nolimits ^{z} $ has only the positive integer solution $(x, y, z)= (1, 1, 2)$, except if $m= 1$. The proof is based on elementary methods and Baker’s method.

Let $q$ be an odd prime such that ${q}^{t} + 1= 2{c}^{s} $, where $c, t$ are positive integers and $s= 1, 2$. We show that the Diophantine equation ${x}^{2} + {q}^{m} = {c}^{n} $ has only the positive integer solution $(x, m, n)= ({c}^{s} - 1, t, 2s)$ under some conditions. The proof is based on elementary methods and a result concerning the Diophantine equation $({x}^{n} - 1)/ (x- 1)= {y}^{2} $ due to Ljunggren. We also verify that when $2\leq c\leq 30$ with $c\not = 12, 24$, the Diophantine equation ${x}^{2} + \mathop{(2c- 1)}\nolimits ^{m} = {c}^{n} $ has only the positive integer solution $(x, m, n)= (c- 1, 1, 2). $

In this paper, we prove that the Sato–Tate conjecture for primitive Maass forms holds on average. We also investigate the rate of convergence in the Sato–Tate conjecture and establish some estimates of the discrepancy with respect to the Sato–Tate measure on the average of primitive Maass forms.

In 2012, Blecher [‘Geometry for totally symmetric plane partitions (TSPPs) with self-conjugate main diagonal’, Util. Math. 88 (2012), 223–235] introduced a special class of totally symmetric plane partitions, called $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}1$-shell totally symmetric plane partitions. Let $f(n)$ denote the number of $1$-shell totally symmetric plane partitions of weight $n$. More recently, Hirschhorn and Sellers [‘Arithmetic properties of 1-shell totally symmetric plane partitions’, Bull. Aust. Math. Soc. to appear. Published online 27 September 2013] discovered a number of arithmetic properties satisfied by $f(n)$. In this paper, employing some results due to Cui and Gu [‘Arithmetic properties of $l$-regular partitions’, Adv. Appl. Math. 51 (2013), 507–523], and Hirschhorn and Sellers, we prove several new infinite families of congruences modulo 4 and 8 for $1$-shell totally symmetric plane partitions. For example, we find that, for $n\geq 0$ and $\alpha \geq 1$,

$$\begin{equation*} f(8 \times 5^{2\alpha } n+39\times 5^{2\alpha -1})\equiv 0 \pmod 8. \end{equation*}$$

A Brahmagupta quadrilateral is a cyclic quadrilateral whose sides, diagonals and area are all integer values. In this article, we characterise the notions of Brahmagupta, introduced by K. R. S. Sastry [‘Brahmagupta quadrilaterals’, Forum Geom. 2 (2002), 167–173], by means of elliptic curves. Motivated by these characterisations, we use Brahmagupta quadrilaterals to construct infinite families of elliptic curves with torsion group $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\mathbb{Z}/2\mathbb{Z}\times \mathbb{Z}/2\mathbb{Z}$ having ranks (at least) four, five and six. Furthermore, by specialising we give examples from these families of specific curves with rank nine.

Let $\Gamma $ be a group and ${\Gamma }^{\prime } $ be a subgroup of $\Gamma $ of finite index. Let $M$ be a $\Gamma $-module. It is shown that $M$ is (strongly) Gorenstein flat if and only if it is (strongly) Gorenstein flat as a ${\Gamma }^{\prime } $-module. We also provide some criteria in which the classes of Gorenstein projective and strongly Gorenstein flat $\Gamma $-modules are the same.

Some inequalities of Jensen type for Arg-square-convex functions of unitary operators in Hilbert spaces are given.

The conformal invariance of Brownian motion is used to give a short proof of the Open Mapping theorem for analytic functions.

We show that the modulus of the Bergman kernel $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}B(z, \zeta )$ of a general homogeneous Siegel domain of type II is ‘almost constant’ uniformly with respect to $z$ when $\zeta $ varies inside a Bergman ball. The control is expressed in terms of the Bergman distance. This result was proved by A. Korányi for symmetric Siegel domains of type II. Subsequently, R. R. Coifman and R. Rochberg used it to establish an atomic decomposition theorem and an interpolation theorem by functions in Bergman spaces $A^p$ on these domains. The atomic decomposition theorem and the interpolation theorem are extended here to the general homogeneous case using the same tools. We further extend the range of exponents $p$ via functional analysis using recent estimates.

The aim of this paper is to obtain a new unique continuation property (UCP) for the Korteweg–de Vries equation posed on a finite interval. Compared with the previous UCP, we need fewer conditions on the solution. For this purpose, we have to establish a global Carleman estimate for the Korteweg–de Vries equation.

Using the method of exponential dichotomies, we establish a new existence and uniqueness theorem for almost automorphic solutions of differential equations with piecewise constant argument of the form

$$\begin{eqnarray*}{x}^{\prime } (t)= A(t)x(t)+ B(t)x(\lfloor t\rfloor )+ f(t), \quad t\in \mathbb{R} ,\end{eqnarray*}$$

$\lfloor \cdot \rfloor $

$A(t), B(t): \mathbb{R} \rightarrow { \mathbb{R} }^{q\times q} $

$f(t): \mathbb{R} \rightarrow { \mathbb{R} }^{q} $

For a discrete abelian cancellative semigroup $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}S$ with a weight function $\omega $ and associated multiplier semigroup $M_\omega (S)$ consisting of $\omega $-bounded multipliers, the multiplier algebra of the Beurling algebra of $(S,\omega )$ coincides with the Beurling algebra of $M_\omega (S)$ with the induced weight.

We show Exel’s tight representation of an inverse semigroup can be described in terms of joins and covers in the natural partial order. Using this, we show that the ${C}^{\ast } $-algebra of a finitely aligned category of paths, developed by Spielberg, is the tight ${C}^{\ast } $-algebra of a natural inverse semigroup. This includes as a special case finitely aligned higher-rank graphs: that is, for such a higher-rank graph $\Lambda $, the tight ${C}^{\ast } $-algebra of the inverse semigroup associated to $\Lambda $ is the same as the ${C}^{\ast } $-algebra of $\Lambda $.

A definition of the reflexive index of a family of (closed) subspaces of a complex, separable Hilbert space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}H$ is given, analogous to one given by D. Zhao for a family of subsets of a set. Following some observations, some examples are given, including: (a) a subspace lattice on $H$ with precisely five nontrivial elements with infinite reflexive index; (b) a reflexive subspace lattice on $H$ with infinite reflexive index; (c) for each positive integer $n$ satisfying dim $H\ge n+1$, a reflexive subspace lattice on $H$ with reflexive index $n$. If $H$ is infinite-dimensional and ${\mathcal{B}}$ is an atomic Boolean algebra subspace lattice on $H$ with $n$ equidimensional atoms and with the property that the vector sum $K+L$ is closed, for every $K,L\in {\mathcal{B}}$, then ${\mathcal{B}}$ has reflexive index at most $n$.

We prove that if a space $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X$ with a rank 2-diagonal either has the countable chain condition or is star countable then the cardinality of $X$ is at most $\mathfrak{c}$.

In this paper, it is shown that every compact Hausdorff $K$-space has countable tightness. This result gives a positive answer to a problem posed by Malykhin and Tironi [‘Weakly Fréchet–Urysohn and Pytkeev spaces’, Topology Appl.104 (2000), 181–190]. We show that a semitopological group $G$ that is a $K$-space is first countable if and only if $G$ is of point-countable type. It is proved that if a topological group $G$ is a $K$-space and has a locally paracompact remainder in some Hausdorff compactification, then $G$ is metrisable.

We introduce a class of discrete-time stochastic processes, called disjunctive processes, which are important for reliable simulations in random iteration algorithms. Their definition requires that all possible patterns of states appear with probability 1. Sufficient conditions for nonhomogeneous chains to be disjunctive are provided. Suitable examples show that strongly mixing Markov chains and pairwise independent sequences, often employed in applications, may not be disjunctive. As a particular step towards a general theory we shall examine the problem arising when disjunctiveness is inherited under passing to a subsequence. An application to the verification problem for switched control systems is also included.

The cubic version of the Lucas cryptosystem is set up based on the cubic recurrence relation of the Lucas function by Said and Loxton [‘A cubic analogue of the RSA cryptosystem’, Bull. Aust. Math. Soc.68 (2003), 21–38]. To implement this type of cryptosystem in a limited environment, it is necessary to accelerate encryption and decryption procedures. Therefore, this paper concentrates on improving the computation time of encryption and decryption in cubic Lucas cryptosystems. The new algorithm is designed based on new properties of the cubic Lucas function and mathematical techniques. To illustrate the efficiency of our algorithm, an analysis was carried out with different size parameters and the performance of the proposed and previously existing algorithms was evaluated with experimental data and mathematical analysis.