arXiv subjects
Publications and source records attributed to Chris Smyth.
We give a complete classification of all Salem polynomials of length 5. For length 6 we show that all but finitely many Salem polynomials lie in one of 12 infinite families, and subject to Lehmer's Conjecture we give a complete list of the 126 exceptions. We provide a table of short polynomials for all known Salem numbers below the smallest Pisot number.
In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two elements, one of which is 0, and the infinite sets {rk}, where r is a fixed positive integer and k runs over all integers not divisible by 3. In the later sections, we solve the analogous problem for subsets of abelian groups. We also discuss, but do not completely solve, the analogous problem for nonabelian groups.
We study the set $\mathscr C$ of mean square values of the moduli of the conjugates of cyclotomic integers $β$. For its $k$th derived set $\mathscr C^{(k)}$, we show that $\mathscr C^{(k)}=(k+1)\mathscr C\,\, (k\ge 0)$, so that also ${\mathscr C}^{(k)}+{\mathscr C}^{(\ell)}={\mathscr C}^{(k+\ell+1)}\,\,(k,\ell\ge 0)$. We also calculate the order type of $\mathscr C$, and show that it is the same as that of the set of PV numbers. Furthermore, we describe precisely the restricted set $\mathscr C_p$ where the $β$ are confined to the ring $\mathbb Z[ω_p]$, where $p$ is an odd prime and $ω_p$ is a primitive $p$th root of unity. In order to do this, we prove that both of the quadratic polynomials $a^2+ab+b^2+c^2+a+b+c$ and $a^2+b^2+c^2+ab+bc+ca+a+b+c$ are universal.
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been known for several decades. In 2007 we extended this classification to arbitrary integer symmetric matrices. In this paper we turn our attention to symmetrizable matrices. We classify the connected nonsymmetric but symmetrizable matrices which have entries in $\Z$ that are maximal with respect to having all their eigenvalues in [-2,2]. This includes a spectral characterisation of the affine and finite Dynkin diagrams that are not simply laced (much as the graph result gives a spectral characterisation of the simply laced ones).
Given a $k$-variable Laurent polynomial $F$, any $l\times k$ integer matrix $A$ naturally defines an $l$-variable Laurent polynomial $F_A.$ I prove that for fixed $F$ the set $\mathcal M(F)$ of all the logarithmic Mahler measures $m(F_A)$ of $F_A$ for all $A$ is a closed subset of the real line. Moreover, the matrices $A$ can be assumed to be of a special form, which I call Primitive Hermite Normal Form. Furthermore, if $F$ has integer coefficients and $\mathcal M(F)$ contains $0,$ then $0$ is an isolated point of this set. I also show that, for a given bound $B>0$, the set ${\mathcal M}_B$ of all Mahler measures of integer polynomials in any number of variables and having length (sum of the moduli of its coefficients) at most $B$ is closed. Again, $0$ is an isolated point of ${\mathcal M}_B$. These results constitute evidence consistent with a conjecture of Boyd from 1980 to the effect that the union $\mathcal L$ of all sets ${\mathcal M}_B$ for $B>0$ is closed, with $0$ an isolated point of $\mathcal L$.
We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting to such polynomials having integer coefficients, we show that the set of logarithmic Mahler measures of the elements of this restricted set is a closed subset of the nonnegative real line, with $0$ being an isolated point of the set. In the final section, we discuss the extent to which such an integer polynomial of Mahler measure $1$ is determined by its $k$ coefficients.
I survey results about, and recent applications of, Salem numbers.
We obtain bounds on the number of maximal torsion cosets for algebraic subvarieties of n-tori, defined over the rationals, using model theoretic methods.
We present a general construction of Salem numbers via rational functions whose zeros and poles mostly lie on the unit circle and satisfy an interlacing condition. This extends and unifies earlier work. We then consider the "obvious" limit points of the set of Salem numbers produced by our theorems, and show that these are all Pisot numbers, in support of a conjecture of Boyd. We then show that all Pisot numbers arise in this way. Combining this with a theorem of Boyd, we show that all Salem numbers are produced via an interlacing construction.
For given integers a,b, and j at least 1 we determine the set of integers n for which a^n-b^n is divisible by n^j. For j=1,2, this set is usually infinite; we find explicitly the exceptional cases for which a,b the set is finite. For j=2, we use Zsigmondy's Theorem for this. For j at least 3 and gcd(a,b)=1, the set is probably always finite; this seems difficult to prove, however. We also show that determination of the set of integers n for which a^n+b^n is divisible by n^j can be reduced to that of the above set.
For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for which n divides u_n and also the set of indices n for which n divides v_n. Building on earlier work, particularly that of Somer, we show that the numbers in these sets can be written as a product of a so-called basic number, which can only be 1, 6 or 12, and particular primes, which are described explicitly. Some properties of the set of all primes that arise in this way is also given, for each kind of sequence.
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
In a previous paper we completely described cyclotomic matrices--integer symmetric matrices of spectral radius at most 2. In this paper we find all minimal noncyclotomic matrices. As a consequence, we are able to determine all integer symmetric matrices of spectral radius at most 2.019, and to determine all integer symmetric matrices whose Mahler measure is at most 1.3. In particular we solve the strong version of Lehmer's problem for integer symmetric matrices: all noncyclotomic matrices have Mahler measure at least "Lehmer's number" 1.17628... .
Given a subvariety $V$ of the complex algebraic torus ${\mathbb G}_{\rm m}^n$ defined by polynomials of total degree at most $d$ and a power map $ϕ: {\mathbb G}_{\rm m}^n \to {\mathbb G}_{\rm m}^n$, the points ${\bf x}$ whose forward orbits ${\mathcal O}_ϕ({\bf x})$ belong to $V$ form its {\em stable} subvariety $S(V,ϕ)$. The main result of the paper provides an upper bound $T=T(n,d,ϕ)$ for the number of iterations of the power map $ϕ$ required to ``cut off'' the points of $V$ that do not belong to $S$.
This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called maximal torsion cosets. We obtain new explicit upper bounds for the number of maximal torsion cosets on an algebraic subvariety of the complex algebraic $n$-torus ${\mathbb G}_{\rm m}^n$. In contrast to earlier works that give the bounds of polynomial growth in the maximum total degree of defining polynomials, the proofs of our results are constructive. This allows us to obtain a new algorithm for determining maximal torsion cosets on an algebraic subvariety of ${\mathbb G}_{\rm m}^n$.
A survey of results for Mahler measure of algebraic numbers, and one-variable polynomials with integer coefficients is presented. Related results on the maximum modulus of the conjugates (`house') of an algebraic integer are also discussed. Some generalisations are given too, though not to Mahler measure of polynomials in more than one variable.
We completely describe all integer symmetric matrices that have all their eigenvalues in the interval [-2,2]. Along the way we classify all signed graphs, and then all charged signed graphs, having all their eigenvalues in this same interval. We then classify subsets of the above for which the integer symmetric matrices, signed graphs and charged signed graphs have all their eigenvalues in the open interval (-2,2).
We use graphs to define sets of Salem and Pisot numbers, and prove that the union of these sets is closed, supporting a conjecture of Boyd that the set of all Salem and Pisot numbers is closed. We find all trees that define Salem numbers. We show that for all integers n the smallest known element of the n-th derived set of the set of Pisot numbers comes from a graph. We define the Mahler measure of a graph, and find all graphs of Mahler measure less than (1+sqrt5)/2. Finally, we list all small Salem numbers known to be definable using a graph.