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$.

We prove a “special point” result for products of elliptic modular surfaces, elliptic curves, multiplicative groups and complex lines, and deduce a result about vanishing linear combinations of singular moduli and roots of unity.

We give a simple graph-theoretic proof of a classical result due to Nash-Williams on covering graphs by forests. Moreover, we derive a slight generalization of this statement where some edges are preassigned to distinct forests.

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}}\mathbb{F}_q$ be the finite field of $q$ elements. An analogue of the regular continued fraction expansion for an element $\alpha $ in the field of formal Laurent series over $\mathbb{F}_q$ is given uniquely by

$$\begin{equation*} \alpha = A_0(\alpha )+\cfrac {1}{A_1(\alpha )+\cfrac {1}{A_2(\alpha )+\ddots }}, \end{equation*}$$

$(A_n(\alpha ))_{n=0}^\infty $

$\mathbb{F}_q$

$\deg (A_n(\alpha ))\ge 1$

$n\ge 1.$

$(p_n)_{n=1}^\infty $

$$\begin{equation*} \lim _{n\to \infty }\frac {1}{n}\sum _{j=1}^n \deg (A_{p_j}(\alpha )) = \frac {q}{q-1} \end{equation*}$$

$\alpha $

$(p_n)_{n=1}^\infty $

$(n)_{n=1}^\infty ,$

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 ${\mathrm{OT} }_{d} (n)$ be the smallest integer $N$ such that every $N$-element point sequence in ${ \mathbb{R} }^{d} $ in general position contains an order-type homogeneous subset of size $n$, where a set is order-type homogeneous if all $(d+ 1)$-tuples from this set have the same orientation. It is known that a point sequence in ${ \mathbb{R} }^{d} $ that is order-type homogeneous, forms the vertex set of a convex polytope that is combinatorially equivalent to a cyclic polytope in ${ \mathbb{R} }^{d} $. Two famous theorems of Erdős and Szekeres from 1935 imply that ${\mathrm{OT} }_{1} (n)= \Theta ({n}^{2} )$ and ${\mathrm{OT} }_{2} (n)= {2}^{\Theta (n)} $. For $d\geq 3$, we give new bounds for ${\mathrm{OT} }_{d} (n)$. In particular, we show that ${\mathrm{OT} }_{3} (n)= {2}^{{2}^{\Theta (n)} } $, answering a question of Eliáš and Matoušek, and, for $d\geq 4$, we show that ${\mathrm{OT} }_{d} (n)$ is bounded above by an exponential tower of height $d$ with $O(n)$ in the topmost exponent.

A natural number $n$ is called abundant if the sum of the proper divisors of $n$ exceeds $n$. For example, $12$ is abundant, since $1+ 2+ 3+ 4+ 6= 16$. In 1929, Bessel-Hagen asked whether or not the set of abundant numbers possesses an asymptotic density. In other words, if $A(x)$ denotes the count of abundant numbers belonging to the interval $[1, x] $, does $A(x)/ x$ tend to a limit? Four years later, Davenport answered Bessel-Hagen’s question in the affirmative. Calling this density $\Delta $, it is now known that $0. 24761\lt \Delta \lt 0. 24766$, so that just under one in four numbers are abundant. We show that $A(x)- \Delta x\lt x/ \mathrm{exp} (\mathop{(\log x)}\nolimits ^{1/ 3} )$ for all large $x$. We also study the behavior of the corresponding error term for the count of so-called $\alpha $-abundant numbers.

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)$.

We solve the equation ${x}^{a} + {x}^{b} + 1= {y}^{q} $ in positive integers $x, y, a, b$ and $q$ with $a\gt b$ and $q\geq 2$ coprime to $\phi (x)$. This requires a combination of a variety of techniques from effective Diophantine approximation, including lower bounds for linear forms in complex and $p$-adic logarithms, the hypergeometric method of Thue and Siegel applied $p$-adically, local methods, and the algorithmic resolution of Thue equations.

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which previously known methods do not apply. In particular, in the case of multiplicative characters modulo a prime $\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$ we break the barrier of $p^{1/4}$ for ranges of individual variables.

Let $P$ and $Q$ be non-zero integers. The generalized Fibonacci sequence $\{ {U}_{n} \} $ and Lucas sequence $\{ {V}_{n} \} $ are defined by ${U}_{0} = 0$, ${U}_{1} = 1$ and ${U}_{n+ 1} = P{U}_{n} + Q{U}_{n- 1} $ for $n\geq 1$ and ${V}_{0} = 2, {V}_{1} = P$ and ${V}_{n+ 1} = P{V}_{n} + Q{V}_{n- 1} $ for $n\geq 1$, respectively. In this paper, we assume that $Q= 1$. Firstly, we determine indices $n$ such that ${V}_{n} = k{x}^{2} $ when $k\vert P$ and $P$ is odd. Then, when $P$ is odd, we show that there are no solutions of the equation ${V}_{n} = 3\square $ for $n\gt 2$. Moreover, we show that the equation ${V}_{n} = 6\square $ has no solution when $P$ is odd. Lastly, we consider the equations ${V}_{n} = 3{V}_{m} \square $ and ${V}_{n} = 6{V}_{m} \square $. It has been shown that the equation ${V}_{n} = 3{V}_{m} \square $ has a solution when $n= 3, m= 1$, and $P$ is odd. It has also been shown that the equation ${V}_{n} = 6{V}_{m} \square $ has a solution only when $n= 6$. We also solve the equations ${V}_{n} = 3\square $ and ${V}_{n} = 3{V}_{m} \square $ under some assumptions when $P$ is even.

A Fourier restriction estimate is obtained for a broad class of conic surfaces by adding a weight to the usual underlying measure. The new restriction estimate exhibits a certain affine-invariance and implies the sharp ${L}^{p} - {L}^{q} $ restriction theorem for compact subsets of a type $k$ conical surface, up to an endpoint. Furthermore, the chosen weight is shown to be, in some quantitative sense, optimal. Appended is a discussion of type $k$ conical restriction theorems which addresses some anomalies present in the existing literature.

In this paper, we consider an initial-value problem for the Korteweg–de Vries equation. The normalized Korteweg–de Vries equation considered is given by

$$\begin{equation*} u_{\tau }+u u_{x}+u_{xxx}=0, \quad -\infty <x<\infty ,\ \tau >0, \end{equation*}$$

$\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$

$\tau $

$u(x,0) =u_{0}>0$

$x \le 0$

$u(x,0)=0$

$x>0$

$\tau $

Let $k\geq 2$ and $\Pi (n)= { \mathop{\prod }\nolimits}_{i= 1}^{k} ({a}_{i} n+ {b}_{i} )$ for some integers ${a}_{i} , {b}_{i} $ ($1\leq i\leq k$). Suppose that $\Pi (n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that the number of prime factors $\Omega (\Pi (n))$ of $\Pi (n)$ is at most ${r}_{k} $, for some integer ${r}_{k} $ depending only on $k$. We use a new kind of weighted sieve to improve the possible values of ${r}_{k} $ when $k\geq 4$.

We show that for self-adjoint Jacobi matrices and Schrödinger operators, perturbed by dissipative potentials in $\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}}\ell ^1({\mathbb{N}})$ and $L^1(0,\infty )$ respectively, the finite section method does not omit any points of the spectrum. In the Schrödinger case two different approaches are presented. Many aspects of the proofs can be expected to carry over to higher dimensions, particularly for absolutely continuous spectrum.

We solve a randomized version of the following open question: is there a strictly convex, bounded curve $\gamma \subset { \mathbb{R} }^{2} $ such that the number of rational points on $\gamma $, with denominator $n$, approaches infinity with $n$? Although this natural problem appears to be out of reach using current methods, we consider a probabilistic analogue using a spatial Poisson process that simulates the refined rational lattice $(1/ d){ \mathbb{Z} }^{2} $, which we call ${M}_{d} $, for each natural number $d$. The main result here is that with probability $1$ there exists a strictly convex, bounded curve $\gamma $ such that $\vert \gamma \cap {M}_{d} \vert \rightarrow + \infty , $ as $d$ tends to infinity. The methods include the notion of a generalized affine length of a convex curve as defined by F. V. Petrov [Estimates for the number of rational points on convex curves and surfaces. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 344 (2007), 174–189; Engl. transl. J. Math. Sci. 147(6) (2007), 7218–7226].

A family $\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}}f_1,\ldots,f_n$ of operators on a complete metric space $X$ is called contractive if there exists $\lambda < 1$ such that for any $x,y$ in $X$ we have $d(f_i(x),f_i(y)) \leq \lambda d(x,y)$ for some $i$. Stein conjectured that for any contractive family there is some composition of the operators $f_i$ that has a fixed point. Austin gave a counterexample to this, and asked whether Stein’s conjecture is true if we restrict to compact spaces. Our aim in this paper is to show that, even for compact spaces, Stein’s conjecture is false.

We investigate sums of mixed powers involving two squares and three biquadrates. In particular, subject to the truth of the Generalised Riemann Hypothesis and the Elliott–Halberstam conjecture, we show that all large natural numbers $n$ with $8\nmid n$, $n\not\equiv 2~(\text{mod} ~3)$ and $n\not\equiv 14~(\text{mod} ~16)$ are the sum of two squares and three biquadrates.

We show an equivalence between a conjecture of Bisztriczky and Fejes Tóth about families of planar convex bodies and a conjecture of Goodman and Pollack about point sets in topological affine planes. As a corollary of this equivalence we improve the upper bound of Pach and Tóth on the Erdős–Szekeres theorem for disjoint convex bodies, as well as the recent upper bound obtained by Fox, Pach, Sudakov and Suk on the Erdős–Szekeres theorem for non-crossing convex bodies. Our methods also imply improvements on the positive fraction Erdős–Szekeres theorem for disjoint (and non-crossing) convex bodies, as well as a generalization of the partitioned Erdős–Szekeres theorem of Pór and Valtr to families of non-crossing convex bodies.