Algebraic Numbers with Integral Power Traces

A set of complex numbers $S$ is called invariant if it is closed under addition and multiplication, namely, for any $x, y \in S$ we have $x+y \in S$ and $xy \in S$ . For each $s \in {\mathbb {C}}$ the smallest invariant set ${\mathbb {N}}[s]$ containing $s$ consists of all possible sums $\sum _{i \in I} a_i s^i$ , where $I$ runs over all finite nonempty subsets of the set of positive integers ${\mathbb {N}}$ and $a_i \in {\mathbb {N}}$ for each $i \in I$ . In this paper, we prove that for $s \in {\mathbb {C}}$ the set ${\mathbb {N}}[s]$ is everywhere dense in ${\mathbb {C}}$ if and only if $s \notin {\mathbb {R}}$ and $s$ is not a quadratic algebraic integer. More precisely, we show that if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is a transcendental number, then there is a positive integer $n$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for either $t=s$ or $t=s+s^2$ . Similarly, if $s \in {\mathbb {C}} \setminus {\mathbb {R}}$ is an algebraic number of degree $d \ne 2, 4$ , then there are positive integers $n, m$ such that the sumset ${\mathbb {N}} t^n+{\mathbb {N}} t^{2n} +{\mathbb {N}} t^{3n}$ is everywhere dense in ${\mathbb {C}}$ for $t=ms+s^2$ . For quadratic and some special quartic algebraic numbers $s$ it is shown that a similar sumset of three sets cannot be dense. In each of these two cases the density of ${\mathbb {N}}[s]$ in ${\mathbb {C}}$ is established by a different method: for those special quartic numbers, it is possible to take a sumset of four sets.

Let $\{ {x_i } \}$ be any sequence approximating an algebraic number $\alpha $ of degree r, and let $x_{i + 1} = \varphi (x_i ,x_{i - 1} , \cdots ,x_{i - d + 1} )$, for some rational function $\varphi $ with integral coefficients. Let M denote the number of multiplications or divisions needed to compute $\varphi $ and let $\bar M$ denote the number of multiplications or divisions, except by constants, needed to compute $\varphi $. Define the multiplicative efficiency measure of $\{ {x_i } \}$ as $E = {{(\log _2 p)} / M}$ or as $\bar E = {{(\log _2 p)} / {\bar M}}$, where p is the order of convergence of $\{ {x_i } \}$. Kung [1] showed that $\bar E \leqq 1$ or equivalently, $\bar M \geqq \log _2 p$. In this paper we show that (i) $\bar M \geqq \log _2 [r(\lceil p \rceil - 1) + 1] - 1$; (ii) if $E = 1$ then $\alpha $ is a rational number; (iii) if $\bar E = 1$ then $\alpha $ is a rational or quadratic irrational number. This settles the question of when the multiplicative efficiency E or $\bar E$ achieves its optimal value of unity. Also, as a consequence of result (i), we show that the maximal efficiency $\bar E$ achievable by algebraic numbers of degree r drops at least as $O[(\log r)^{ - 1} ]$, provided that we only consider sequences $\{ {x_i } \}$ of bounded order of convergence.

Let Q denote the rational number field and α be an algebraic number of degree s. Then the algebraic number field F s = Q(α) is the field given by the polynomials in α of degree < s with rational coefficients.

We begin with some preliminaries on algebraic numbers. Let α be an algebraic number. Then we observe that α satisfies the polynomial of minimal degree such that it has relatively prime integer coefficients and the leading coefficient positive. This is the minimal polynomial of α. The degree of this polynomial is called the degree of α. The maximum of the absolute values of the coefficients of this polynomial is called the height of α. We write ν = ν(α) for the least positive integer such that να is an algebraic integer i.e., να satisfies a monic polynomial with integer coefficients. The integer ν exists and we say that it is the denominator of α.

We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, following Bernardi and Bousquet-Mélou [ J. Comb. Theory Ser. B , 101 (2011), 315–377]. The decomposition of a map into 2- and 3-connected components allows us to obtain the generating functions of 2- and 3-connected bicoloured maps. Setting to zero the variable marking monochromatic edges we obtain the generating function of 3-connected bipartite maps, which is algebraic of degree 26. We deduce from it an asymptotic estimate for the number of 3-connected bipartite planar maps of the form <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>t</mml:mi> <mml:mspace width="0.166667em"/> <mml:msup> <mml:mi>n</mml:mi> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>5</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:msup> <mml:msup> <mml:mi>γ</mml:mi> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> , where <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>γ</mml:mi> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>ρ</mml:mi> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> <mml:mo>≈</mml:mo> <mml:mn>2</mml:mn> <mml:mo>.</mml:mo> <mml:mn>40958</mml:mn> </mml:mrow> </mml:math> and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>ρ</mml:mi> <mml:mo>≈</mml:mo> <mml:mn>0</mml:mn> <mml:mo>.</mml:mo> <mml:mn>41501</mml:mn> </mml:mrow> </mml:math> is an algebraic number of degree <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mn>10</mml:mn> </mml:math> .

In the problem session of the Journées Arithmétiques 1989 in Luminy, Bourgain made the followingConjecture. Suppose α is an algebraic number of degree d. Assume that for each n∈ ℕThen there exists a constant c = c(α) with the following property: given any subspace W of dimension ≤ d − 1 of the d-dimensional ℚ-vector space ℚ(α), the set {n|n∈ℕ,αn∈W} contains fewer than c(α) elements.

It is known that the transcendental and rational numbers in the unit interval are not binomial numbers. In this article we will show that the algebraic integers of degree 2 are not binomial numbers either. Therefore two shift invariant measures u ( s ) , u ( r ) u(s),u(r) with r r being an algebraic integer of degree 2 in the unit interval are topologically equivalent if and only if s = r s = r or s = 1 − r s = 1 - r . We also show that for each positive integer n &gt; 2 n{\text { &gt; 2}} , there are algebraic integers and fractionals of degree n n in the unit interval that are binomial numbers.

In this paper, we prove a weak form of the conjecture generalised to algebraic number fields. Given integers satisfying , Stewart and Yu were able to give an exponential bound in terms of the radical over the integers (Stewart and Yu [Math. Ann. 291 (1991), 225–230], Stewart and Yu [Duke Math. J. 108 (2001), no. 1, 169–181]), whereas Győry was able to give an exponential bound in the algebraic number field case for the projective height in terms of the radical for algebraic numbers (Győry [Acta Arith. 133 (2008), 281–295]). We generalise Stewart and Yu's method to give an improvement on Győry's bound for algebraic integers over the Hilbert Class Field of the initial number field K. Given algebraic integers in a number field K satisfying , we give an upper bound for the logarithm of the projective height in terms of norms of prime ideals dividing , where L is the Hilbert Class Field of K. In many cases, this allows us to give a bound in terms of the modified radical as given by Masser (Proc. Amer. Math. Soc. 130 (2002), no. 11, 3141–3150). Furthermore, by employing a recent bound of Győry (Publ. Math. Debrecen 94 (2019), 507–526) on the solutions of S‐unit equations, our estimates imply the upper bound where is an effectively computable constant. Further, given conditions on the largest prime ideal dividing , we obtain a sub‐exponential bound for in terms of the radical. Independently, as a direct application of his bounds on the solutions of S‐unit equations(Győry ([Publ. Math. Debrecen 94 (2019), 507–526]), Győry (Publ. Math. Debrecen 100 (2022), 499–511) also attains results mentioned above, including the above inequality, but over the base field K, as discussed in Section 6. As a consequence of our results, we will give an application to the effective Skolem–Mahler–Lech problem and give an improvement to a result by Lagarias and Soundararajan (J. Théor. Nombres Bordeaux 23 (2011), no. 1, 209–234) on the XYZ conjecture.

A chromatic root is a root of the chromatic polynomial of a graph. Any chromatic root is an algebraic integer. Much is known about the location of chromatic roots in the real and complex numbers, but rather less about their properties as algebraic numbers. This question was the subject of a seminar at the Isaac Newton Institute in late 2008. The purpose of this paper is to report on the seminar and subsequent developments.We conjecture that, for every algebraic integer $\alpha$, there is a natural number n such that $\alpha+n$ is a chromatic root. This is proved for quadratic integers; an extension to cubic integers has been found by Adam Bohn. The idea is to consider certain special classes of graphs for which the chromatic polynomial is a product of linear factors and one "interesting" factor of larger degree. We also report computational results on the Galois groups of irreducible factors of the chromatic polynomial for some special graphs. Finally, extensions to the Tutte polynomial are mentioned briefly.

Let [Formula: see text] be an algebraic number field with [Formula: see text] an algebraic integer having minimal polynomial [Formula: see text] over the field [Formula: see text] of rational numbers and [Formula: see text] be the ring of algebraic integers of [Formula: see text]. For a fixed prime number [Formula: see text], let [Formula: see text] be the factorization of [Formula: see text] modulo [Formula: see text] as a product of powers of distinct irreducible polynomials over [Formula: see text] with [Formula: see text] monic. In 1878, Dedekind proved a significant result known as Dedekind Criterion which says that the prime number [Formula: see text] does not divide the index [Formula: see text] if and only if [Formula: see text] is coprime with [Formula: see text] where [Formula: see text]. This criterion has been widely used and generalized. In this paper, a simple proof of Generalized Dedekind Criterion [S. K. Khanduja and M. Kumar, On Dedekind criterion and simple extensions of valuation rings, Comm. Algebra 38 (2010) 684–696] using elementary valuation theory is given.

In an algebraic number field K the ring Jk, generated by the k-th powers of all integers of K, and the additive group Ĵk, generated by the k-th powers of all primes of K, are investigated. Necessary and sufficient conditions for the case Ĵk=J1 are given. When k is prime to the discriminant of K a simple characterization of Jk is found and the case Ĵk=Jk is settled. Analogous results are obtained if one considers algebraic integers and primes of fixed signatures.

In this note, we prove that quadratic algebraic integers, except for trivial cases, are not Mahler measures of algebraic integers and we also answer in negative the question of A. Schinzel [9] whether $1+\sqrt {17}$ is a Mahler measure of an algebraic number.

Computing GCDs of Polynomials over Algebraic Number Fields

For an arbitrary (not totally real) number field K of degree ≥3, we ask how many perfect powers γ p of algebraic integers γ in K exist, such that μ(τ(γ p ))≤X for each embedding τ of K into the complex field. (X a large real parameter, p≥2 a fixed integer, and μ(z)=max(| Re (z)|,| Im (z)|) for any complex z.) This quantity is evaluated asymptotically in the form c p,K X n/p +R p,K (X), with sharp estimates for the remainder R p,K (X). The argument uses techniques from lattice point theory along with W. Schmidt’s multivariate extension of K.F. Roth’s result on the approximation of algebraic numbers by rationals.

If $\alpha_1,\ldots,\alpha_r$ are algebraic numbers such that $$N=\sum_{i=1}^r\alpha_i \ne \sum_{i=1}^r\alpha_i^{-1}$$ for some integer $N$, then a theorem of Beukers and Zagier gives the best possible lower bound on $$\sum_{i=1}^r\log h(\alpha_i)$$ where $h$ denotes the Weil Height. We will extend this result to allow $N$ to be any totally real algebraic number. Our generalization includes a consequence of a theorem of Schinzel which bounds the height of a totally real algebraic integer.