Motivated by mathematical aspects of origami, Erik Demaine asked which points in the plane can be constructed by using lines whose angles are multiples of $\pi /n$ for some fixed $n$. This has been answered for some specific small values of $n$ including $n=3,4,5,6,8,10,12,24$. We answer this question for arbitrary $n$. The set of points is a subring of the complex plane $\mathbf {C}$, lying inside the cyclotomic field of $n$th roots of unity; the precise description of the ring depends on whether $n$is prime or composite. The techniques apply in more general situations, for example, infinite sets of angles, or more general constructions of subsets of the plane.

We give new bounds on sums of the form ∑ n≤NΛ(n)exp (2πiagn/m) and ∑ n≤NΛ(n)χ(gn+a), where Λ is the von Mangoldt function, m is a natural number, a and g are integers coprime to m, and χ is a multiplicative character modulo m. In particular, our results yield bounds on the sums ∑ p≤Nexp (2πiaMp/m) and ∑ p≤Nχ(Mp) with Mersenne numbers Mp=2p−1, where p is prime.

Let K be a number field. For f∈K[x], we give an upper bound on the least positive integer T=T(f) such that no quotient of two distinct Tth powers of roots of f is a root of unity. For each ε>0 and each f∈ℚ[x] of degree d≥d(ε) we prove that . In the opposite direction, we show that the constant 2 cannot be replaced by a number smaller than 1 . These estimates are useful in the study of degenerate and nondegenerate linear recurrence sequences over a number field K.

We provide evaluations of several recently studied higher and multiple Mahler measures using log-sine integrals. This is complemented with an analysis of generating functions and identities for log-sine integrals which allows the evaluations to be expressed in terms of zeta values or more general polylogarithmic terms. The machinery developed is then applied to evaluation of further families of multiple Mahler measures.

Let r be an integer greater than 1, and let A be a finite, nonempty set of nonzero integers. We obtain a lower bound for the number of positive squarefree integers n, up to x, for which the products ∏ p∣n(p+a) (over primes p) are perfect rth powers for all the integers a in A. Also, in the cases where A={−1} and A={+1}, we will obtain a lower bound for the number of such n with exactly r distinct prime factors.

In this paper, we propose a matrix-variate generalization of the Gauss hypergeometric distribution and study several of its properties. We also derive probability density functions of the product of two independent random matrices when one of them is Gauss hypergeometric. These densities are expressed in terms of Appell’s first hypergeometric function F1 and Humbert’s confluent hypergeometric function Φ1of matrix arguments.

We introduce a new construction involving Rees matrix semigroups and max-plus algebras that is very convenient for generating sets of centroids. We describe completely all optimal sets of centroids for all Rees matrix semigroups without any restrictions on the sandwich matrices.

In this paper we solve the equation f(g(x))=f(x)hm(x) where f(x), g(x) and h(x) are unknown polynomials with coefficients in an arbitrary field K, f(x) is nonconstant and separable, deg g≥2, the polynomial g(x) has nonzero derivative g′(x)≠0 in K[x] and the integer m≥2 is not divisible by the characteristic of the field K. We prove that this equation has no solutions if deg f≥3 . If deg f=2 , we prove that m=2 and give all solutions explicitly in terms of Chebyshev polynomials. The Diophantine applications for such polynomials f(x) , g(x) , h(x) with coefficients in ℚ or ℤ are considered in the context of the conjecture of Cassaigne et al. on the values of Liouville’s λ function at points f(r) , r∈ℚ.

We discuss the following general question and some of its extensions. Let (εk)k≥1 be a sequence with values in {0,1}, which is not ultimately periodic. Define ξ:=∑ k≥1εk/2k and ξ′:=∑ k≥1εk/3k. Let 𝒫 be a property valid for almost all real numbers. Is it true that at least one among ξ and ξ′ satisfies 𝒫?

We investigate the number of symmetric matrices of nonnegative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero-diagonal symmetric contingency tables with uniform margins, or loop-free regular multigraphs. We determine the asymptotic value of this number as the size of the matrix tends to infinity, provided the row sum is large enough. We conjecture that one form of our answer is valid for all row sums. An example appears in Figure 1.

Brizolis asked for which primes p greater than 3 there exists a pair (g,h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g. Various authors have contributed to the understanding of this problem. In this paper, we use p-adic methods, primarily Hensel’s lemma and p-adic interpolation, to count fixed points, two-cycles, collisions, and solutions to related equations modulo powers of a prime p.

In 1987, Gordon gave an integer primality condition similar to the familiar test based on Fermat’s little theorem, but based instead on the arithmetic of elliptic curves with complex multiplication. We prove the existence of infinitely many composite numbers simultaneously passing all elliptic curve primality tests assuming a weak form of a standard conjecture on the bound on the least prime in (special) arithmetic progressions. Our results are somewhat more general than both the 1999 dissertation of the first author (written under the direction of the third author) and a 2010 paper on Carmichael numbers in a residue class written by Banks and the second author.

This paper is concerned with the bifurcation of limit cycles from a quadratic reversible system under polynomial perturbations. It is proved that the cyclicity of the period annulus is two, and also a linear estimate of the number of zeros of the Abelian integral for the system under polynomial perturbations of arbitrary degree nis given.

Denote the nth convergent of the continued fraction α=[a0;a1,a2,…] by pn/qn=[a0;a1,…,an]. In this paper we give exact formulae for the quantities Dn:=qnα−pn in several typical types of Tasoev continued fractions. A simple example of the type of Tasoev continued fraction considered is α=[0;ua,ua2,ua3,…].

We describe a variant of Fermat’s factoring algorithm which is competitive with SQUFOF in practice but has heuristic run time complexity O(n1/3) as a general factoring algorithm. We also describe a sparse class of integers for which the algorithm is particularly effective. We provide speed comparisons between an optimised implementation of the algorithm described and the tuned assortment of factoring algorithms in the Pari/GP computer algebra package.

We consider a multi-parameter family of canonical coordinates and mirror maps originally introduced by Zudilin. This family includes many of the known one-variable mirror maps as special cases, in particular many of modular origin and the celebrated ‘quintic’ example of Candelas, de la Ossa, Green and Parkes. In a previous paper, we proved that all coefficients in the Taylor expansions at 0 of these canonical coordinates (and, hence, of the corresponding mirror maps) are integers. Here we prove that all coefficients in their Taylor expansions at 0 are positive. Furthermore, we provide several results about the behaviour of the canonical coordinates and mirror maps as complex functions. In particular, we address their analytic continuation, points of singularity, and radius of covergence. We present several very precise conjectures on the radius of covergence of the mirror maps and the sign pattern of the coefficients in their Taylor expansions at 0.

In this paper we present new explicit simultaneous rational approximations which converge subexponentially to the values of the Bell polynomials at the points where m=1,2,…,a, a∈ℕ, γ is Euler’s constant and ζ is the Riemann zeta function.

It is well known that Thom–Boardman symbols are realized by nonincreasing sequences of nonnegative integers. A natural question is whether the converse is also true. In this paper we answer this question affirmatively, that is, for any nonincreasing sequence of nonnegative integers, there is at least one map-germ with the prescribed sequence as its Thom–Boardman symbol.

Let 𝕂⊂ℂ be a number field. We show how to compute 𝕂-irrationality measures of a number ξ∉𝕂, and 𝕂-nonquadraticity measures of ξ if [𝕂(ξ):𝕂]>2. By applying the saddle point method to a family of double complex integrals, we prove ℚ(α)-irrationality measures and ℚ(α)-nonquadraticity measures of log α for several algebraic numbers α∈ℂ, improving earlier results due to Amoroso and the second-named author.

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields defined over number fields contain infinitely many irreducible elements. We also prove that an elliptic divisibility sequence over a function field has only finitely many terms lacking a primitive divisor.