We study the automorphic Green function $\mathop{\rm gr}\nolimits _\Gamma $ on quotients of the hyperbolic plane by cofinite Fuchsian groups $\Gamma $, and the canonical Green function $\mathop{\rm gr}\nolimits ^{\rm can}_X$ on the standard compactification $X$ of such a quotient. We use a limiting procedure, starting from the resolvent kernel, and lattice point estimates for the action of $\Gamma $ on the hyperbolic plane to prove an “approximate spectral representation” for $\mathop{\rm gr}\nolimits _\Gamma $. Combining this with bounds on Maaß forms and Eisenstein series for $\Gamma $, we prove explicit bounds on $\mathop{\rm gr}\nolimits _\Gamma $. From these results on $\mathop{\rm gr}\nolimits _\Gamma $ and new explicit bounds on the canonical $(1,1)$-form of $X$, we deduce explicit bounds on $\mathop{\rm gr}\nolimits ^{\rm can}_X$.

Let $X$ be a smooth proper curve over a finite field of characteristic $p$. We prove a product formula for $p$-adic epsilon factors of arithmetic $\mathscr{D}$-modules on $X$. In particular we deduce the analogous formula for overconvergent $F$-isocrystals, which was conjectured previously. The $p$-adic product formula is a counterpart in rigid cohomology of the Deligne–Laumon formula for epsilon factors in $\ell$-adic étale cohomology (for $\ell \neq p$). One of the main tools in the proof of this $p$-adic formula is a theorem of regular stationary phase for arithmetic $\mathscr{D}$-modules that we prove by microlocal techniques.

We study the limiting behavior of the discrete spectra associated to the principal congruence subgroups of a reductive group over a number field. While this problem is well understood in the cocompact case (i.e., when the group is anisotropic modulo the center), we treat groups of unbounded rank. For the groups $\text{GL}(n)$ and $\text{SL}(n)$ we show that the suitably normalized spectra converge to the Plancherel measure (the limit multiplicity property). For general reductive groups we obtain a substantial reduction of the problem. Our main tool is the recent refinement of the spectral side of Arthur’s trace formula obtained in [Finis, Lapid, and Müller, Ann. of Math. (2) 174(1) (2011), 173–195; Finis and Lapid, Ann. of Math. (2) 174(1) (2011), 197–223], which allows us to show that for $\text{GL}(n)$ and $\text{SL}(n)$ the contribution of the continuous spectrum is negligible in the limit.

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial, is a very old problem. Currently, the best algorithmic solution is Stauduhar’s method. Computationally, one of the key challenges in the application of Stauduhar’s method is to find, for a given pair of groups $H<G$, a $G$-relative $H$-invariant, that is a multivariate polynomial $F$ that is $H$-invariant, but not $G$-invariant. While generic, theoretical methods are known to find such $F$, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm.

We apply the endoscopic classification of automorphic forms on $U(3)$ to study the growth of the first Betti number of congruence covers of a Picard modular surface. As a consequence, we establish a case of a conjecture of Sarnak and Xue on cohomology growth.

Let $\nu _{f}(n)$ be the $n\mathrm{th}$ normalized Fourier coefficient of a Hecke–Maass cusp form $f$ for ${\rm SL }(2,\mathbb{Z})$ and let $\alpha $ be a real number. We prove strong oscillations of the argument of $\nu _{f}(n)\mu (n) \exp (2\pi i n \alpha )$ as $n$ takes consecutive integral values.

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.

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.

Let $K_1$ and $K_2$ be complete discrete valuation fields of residue characteristic $p>0$. Let $\pi _{K_1}$ and $\pi _{K_2}$ be their uniformizers. Let $L_1/K_1$ and $L_2/K_2$ be finite extensions with compatible isomorphisms of rings $\mathcal{O}_{K_1}/(\pi _{K_1}^m)\, {\simeq }\, \mathcal{O}_{K_2}/(\pi _{K_2}^m)$ and $\mathcal{O}_{L_1}/(\pi _{K_1}^m)\, {\simeq }\, \mathcal{O}_{L_2}/(\pi _{K_2}^m)$ for some positive integer $m$ which is no more than the absolute ramification indices of $K_1$ and $K_2$. Let $j\leq m$ be a positive rational number. In this paper, we prove that the ramification of $L_1/K_1$ is bounded by $j$ if and only if the ramification of $L_2/K_2$ is bounded by $j$. As an application, we prove that the categories of finite separable extensions of $K_1$ and $K_2$ whose ramifications are bounded by $j$ are equivalent to each other, which generalizes a theorem of Deligne to the case of imperfect residue fields. We also show the compatibility of Scholl’s theory of higher fields of norms with the ramification theory of Abbes–Saito, and the integrality of small Artin and Swan conductors of $p$-adic representations with finite local monodromy.

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*}$$

We describe algorithms that allow the computation of fundamental domains in the Bruhat–Tits tree for the action of discrete groups arising from quaternion algebras. These algorithms are used to compute spaces of rigid modular forms of arbitrary even weight, and we explain how to evaluate such forms to high precision using overconvergent methods. Finally, these algorithms are applied to the calculation of conjectural equations for the canonical embedding of p-adically uniformizable rational Shimura curves. We conclude with an example in the case of a genus 4 Shimura curve.

Let $Q(N;q,a)$ be the number of squares in the arithmetic progression $qn+a$, for $n=0$,$1,\ldots,N-1$, and let $Q(N)$ be the maximum of $Q(N;q,a)$ over all non-trivial arithmetic progressions $qn + a$. Rudin’s conjecture claims that $Q(N)=O(\sqrt{N})$, and in its stronger form that $Q(N)=Q(N;24,1)$ if $N\ge 6$. We prove the conjecture above for $6\le N\le 52$. We even prove that the arithmetic progression $24n+1$ is the only one, up to equivalence, that contains $Q(N)$ squares for the values of $N$ such that $Q(N)$ increases, for $7\le N\le 52$ ($N=8,13,16,23,27,36,41$ and $52$).

Supplementary materials are available with this article.

We show that if a Barker sequence of length $n>13$ exists, then either n $=$ 3 979 201 339 721 749 133 016 171 583 224 100, or $n > 4\cdot 10^{33}$. This improves the lower bound on the length of a long Barker sequence by a factor of nearly $2000$. We also obtain eighteen additional integers $n<10^{50}$ that cannot be ruled out as the length of a Barker sequence, and find more than 237 000 additional candidates $n<10^{100}$. These results are obtained by completing extensive searches for Wieferich prime pairs and using them, together with a number of arithmetic restrictions on $n$, to construct qualifying integers below a given bound. We also report on some updated computations regarding open cases of the circulant Hadamard matrix problem.

We give an asymptotic formula for the number of primes $\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}}p \le x$ of the form $p = [n_1^{c_1}] = \cdots = [n_d^{c_d}]$, where $c_1, \ldots, c_d$ are greater than 1 but “sufficiently close” to 1. This improves work of E. R. Sirota $(d=2)$ and W. Zhai $(d \ge 3)$.

How many square tiles are needed to tile a circular floor? Tiles are cut to fit the boundary. We give an algorithm for cutting, rotating and re-using the off-cut parts, so that a circular floor requires $\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}} \pi R^2 + O(\delta R) + O(R^{2/3}) $ tiles, where $R$ is the radius and $\delta $ is the width of the cutting tool. The algorithm applies to any oval-shaped floor whose boundary has a continuous non-zero radius of curvature. The proof of the error estimate requires methods of analytic number theory.

Let $\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}}p$ be a prime and $b$ a primitive root of $p^2$. In this paper, we give an explicit formula for the number of times a value in $\{0,1,\ldots,b-1\}$ occurs in the periodic part of the base-$b$ expansion of $1/p^m$. As a consequence of this result, we prove two recent conjectures of Aragón Artacho et al. [‘Walking on real numbers’, Math. Intelligencer35(1) (2013), 42–60] concerning the base-$b$ expansion of Stoneham numbers.

We construct new indecomposable elements in the higher Chow group $CH^2(A,1)$ of a principally polarized Abelian surface over a $p$-adic local field, which generalize an element constructed by Collino [Griffiths’ infinitesimal invariant and higher K-theory on hyperelliptic Jacobians, J. Algebraic Geom. 6 (1997), 393–415]. These elements are constructed using a generalization, due to Birkenhake and Wilhelm [Humbert surfaces and the Kummer plane, Trans. Amer. Math. Soc. 355 (2003), 1819–1841 (electronic)], of a classical construction of Humbert. They can be used to prove a non-Archimedean analogue of the Hodge-${\mathcal{D}}$-conjecture – namely, the surjectivity of the boundary map in the localization sequence – in the case where the Abelian surface has good and ordinary reduction.

As the simplest case of Langlands functoriality, one expects the existence of the symmetric power $S^n(\pi )$, where $\pi $ is an automorphic representation of ${\rm GL}(2,{\mathbb{A}})$ and ${\mathbb{A}}$ denotes the adeles of a number field $F$. This should be an automorphic representation of ${\rm GL}(N,{\mathbb{A}})$ ($N=n+1)$. This is known for $n=2,3$ and $4$. In this paper we show how to deduce the general case from a recent result of J.T. on deformation theory for ‘Schur representations’, combined with expected results on level-raising, as well as another case (a particular tensor product) of Langlands functoriality. Our methods assume $F$ totally real, and the initial representation $\pi $ of classical type.

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.

In this paper we generalize the work of Harris–Soudry–Taylor and construct the compatible systems of two-dimensional Galois representations attached to cuspidal automorphic representations of cohomological type on ${\rm GL}_2$ over a CM field with a suitable condition on their central characters. We also prove a local-global compatibility statement, up to semi-simplification.