Minimal polynomials of some beta-numbers and Chebyshev polynomials
|
|
- Dora Atkinson
- 5 years ago
- Views:
Transcription
1 Minimal polynomials of some beta-numbers and Chebyshev polynomials DoYong Kwon Abstract We consider the β-expansion of 1 which encodes a rational rotation on R/Z under a certain partition Via transforming its β- polynomial into a linear combination of Chebyshev polynomials, we specify the minimal polynomial of β over the field of rationals At the end, some number theoretical conjectures are posed with computational evidence to support them 1 Introduction For β > 1, the β-transformation T β : x βx (mod 1) is multiplication by β modulo 1 Then the β-expansion d β (x) = (x i ) i 1 of x [0, 1] is defined by x i = βt i 1 β (x) While Rényi [14] introduced the β-transformation and proved that it is ergodic, Parry [1] found its invariant measure and characterized possible sequences that can be a β-expansion It was shown that the β-expansion of 1 specifies any other β-expansion of x [0, 1) in terms of lexicographic order To be more precise, let us fix β > 1 and assume that s = x 1 x is an infinite word over an alphabet {0, 1,, β } In addition, putting d β(1) := lim d β (1 ɛ), ɛ 0 we have d β (1) = (e 1 e m 1 (e m 1)) ω if d β (1) = e 1 e m 0 ω and d β (1) = d β (1) otherwise Here a ω := aa Then Parry showed that s = d β (x) for some x [0, 1) if and only if σ n (s) < d β (1) for all n 0, where σ is the shift If d β (1) is eventually periodic, say d β (1) = e 1 e n (e n+1 e n+p ) ω, then we call β a beta-number In this case, β is the dominant root of ( ) ( ) n+p x n+p e i x n+p i x n e i x n i = Mathematics Subject Classification: Primary 11R06, 11R09; Secondary 37B10, 68R15 Key words: beta-numbers, Chebyshev polynomials, Pisot numbers, Mahler measure 1
2 In particular if d β (1) is finite, ie, d β (1) = e 1 e n 0 ω, then we call β a simple beta-number and β is the dominant root of x n e i x n i = 0 These two polynomials above are called the beta-polynomial of each β, or simply the β-polynomial if β is clear from the context The term characteristic polynomial is also used in the literature The special class of β-expansions will be focused on We study a real β > 1 for which d β (1) encodes a rational rotation on R/Z In this case, β is an algebraic integer For the case of irrational rotation, see [4, 6] Arithmetic study was also pursued there and the current work is in fact motivated by these previous papers Let α > 0 and ρ [0, 1] We consider the following two infinite sequences called lower and upper mechanical words with slope α and intercept ρ: for n 0, s α,ρ (n) = α(n + 1) + ρ αn + ρ, s α,ρ(n) = α(n + 1) + ρ αn + ρ Note that these are infinite words over the alphabet A = { α 1, α } For an irrational α, the words are aperiodic and called Sturmian words On the other hand a rational α produces purely periodic words, whose shortest period words are called Christoffel words Our main concern is the latter We need to describe this in more detail Let the slope be α = p/q > 0 with gcd(p, q) = 1 and b = α Then the working alphabet is A = {b 1, b} and the lengths of the Christoffel words, say, t p,q, t p,q are q So one has s α,0 = t ω p,q and s α,0 = t p,qω They are also represented by t p,q = (b 1)z p,q b, t p,q = bz p,q (b 1), for some word z p,q, called a central word We see that z p,q is a palindrome, ie, z p,q is equal to its reversal See [11] The motivation of this paper originated from the next proposition For any word w = a 0 a 1 a n 1 with a i Z, we denote by w, a vector (a 0,, a n 1 ) Z n Proposition 11 ([4, 6]) For α > 0, there exists a unique β > 1 for which d β (1) = s α,0 So define : (0, ) (1, ) by (α) = β Then (a) At an irrational α > 0, then is continuous and (α) is a transcendental number
3 (b) is left-continuous but not right-continuous at every rationals (c) If α = p/q with gcd(p, q) = 1 and b = α, then the (α)-polynomial is x q bz p,q b (x q 1, x q,, 1), (d) With the same rational α as above, let (α+) := lim x α+ (x) Then the (α+)-polynomial is x q+1 bz p,q b (x q, x q 1,, x) x + 1 For a rational α > 0, (α) is called a lower self-christoffel number, and the right limit (α+) an upper self-christoffel number We are now in a position to state our main theorem THEOREM Let p 0 /q 0 be a fixed rational with 0 < p 0 q 0 and gcd(p 0, q 0 ) = 1 For a positive integer b, suppose p/q = b 1 + p 0 /q 0 Then there exists an effectively computable B such that for all b B, we have: (a) x q bz p,q b (x q 1, x q,, 1) is irreducible over Q, (b) x q+1 bz p,q b (x q, x q 1,, x) x + 1 is irreducible over Q Thus the polynomials mentioned are eventually the minimal polynomials of (p/q) and (p/q+) The above theorem was in fact proved in [7] but we did not know from which value b on, the polynomials are irreducible We give here another proof involving Chebyshev polynomials The new proof enables us to find B effectively for which b B implies the corresponding polynomials are irreducible over Q The effective procedure for finding B is demonstrated at page 10 This quantitative results accordingly lead us to some connection with other fields of mathematics, which will be discussed in Section 4 Preliminaries In this section we briefly review some concepts and known results to be used in the main proof First we recall some definitions in number theory Among algebraic integers, a Pisot number is α > 1 all of whose conjugates lie inside the unit circle Suppose g(x) = a n x n + + a 1 x + a 0 = a n n (x α i) Z[x] with a n 0 Then the Mahler measure of g is a positive number defined by n M(g) = a n max{1, α i } 3
4 In particular, cyclotomic polynomials have 1 as their Mahler measures The most famous problem on Mahler measures, posed by Lehmer [9], is whether or not 1 is an accumulation point of the set {M(g) g Z[x]} Though it is still open, a certain answer can be given for a special subclass of polynomials Let f R[x] and deg(f) = n If f satisfies f(x) = x n f(x 1 ) then we say that f is reciprocal Now the Mahler measures of nonreciprocal polynomials cannot be less than the smallest Pisot number as stated below Theorem 1 ([16]) Let p(x) Z[x] and let θ 0 = 1347 be the smallest Pisot number, ie, the real zero of x 3 x 1 If M(p) < θ 0, then p(x) is a reciprocal polynomial Let us denote by T n and U n the n th Chebyshev polynomials of the first and the second kinds respectively Among many equivalent definitions we adopt the following simple equations, which are suitable for our proof T n (cos θ) := cos nθ, U n (cos θ) := sin(n + 1)θ sin θ For instance, T (x) = x 1 and U 3 (x) = 8x 3 4x In analysis of our polynomials, we encounter some reciprocal polynomials, and they will be converted into more convenient ones to handle via some transformation introduced in [3] Suppose that p(z) = n i=0 a iz i R[z] is a nonzero reciprocal polynomial with a i = a n i, i = 0,, n If a n = a n 1 = = a n+k+1 = 0 but a n+k 0 hold, then we observe that [ ( p(z) = a i z i = z n a n+k z k + 1 ) ( + + a z k n+1 z + 1 ) ] + a n z i=0 = a n+k z n k ( z + 1 ) z α i k = a n+k z n k (z α i z + 1), for some α i C, i = 1,, k Given a reciprocal polynomial p as above, the Chebyshev transform T of p is defined by T p(x) := a n+k k (x α i ) Theorem ([3]) The Chebyshev transform T is a linear isomorphism of the space of real reciprocal polynomials, {p(z) = n i=0 a iz i R[z] : a i = a n i, i = 0,, n} into the space of real polynomials of degree at most n One notes that p(e iθ ) = T p( cos θ) Chebyshev polynomials now naturally appear via Chebyshev transforms 4
5 Lemma 3 ([8]) If p(z) = z n + 1 and q(z) = z n + z n + + z + 1, then T p(x) = T n (x/) and T q(x) = U n (x/) The following geometric study on beta-polynomials will be useful below The reader should note that all the bounds given in the proposition tend to 1 as β increases Proposition 4 ([7]) (a) If β is an upper self-christoffel number and γ β is a zero of the β-polynomial, then γ β + β + 4β β (b) If β is a lower self-christoffel number and γ β is a zero of the β-polynomial, then β + 1 8β + 1 β γ β β + 1 β 3 Proof Throughout this section, notations appearing in THEOREM will be used without explicit mention First we consider lower self-christoffel numbers Put f(x) = x q bz p,q b (x q 1, x q,, 1) and suppose that f(x) = g(x)h(x) over Q and g(β) 0 = h(β) Then Theorem 1 together with Proposition 4 implies that g is eventually reciprocal as b increases If γ is a zero of g, then γ 1 is also a zero of g Thus one has γ q = bz p,q b (γ q 1, γ q,, 1) = γ q 1 bz pb,qb (γ 1 q, γ q,, 1) = γ q 1 γ q = γ 1, where we use the fact that bz p,q b is a palindrome So we conclude γ q+1 = 1 Let us assume that q = n + 1 and γ j = e iθ j = e jπi/(q+1) is a zero of g for some j = 1,, q We then consider a polynomial r(z) := z q f(z) = bz p,q b (z n, z n 1,, 1) = b(z n + z n ) a k z k (z n k + 1), a k {0, 1/, 1} Together with an equation z n +z n = (z n +z n + +z +1)+z(z n +z n 4 + +z +1), 5
6 Lemma 3 guarantees that the Chebyshev transform of r(z) is ( ( x ) ( x )) T r(x) = b U n + U n 1 ( x ) a k T n k To compute T r( cos θ j ), we use the fact that T n k (cos θ j ) = cos(n k)θ j and that U n (cos θ j ) + U n 1 (cos θ j ) = sin(n + 1)θ j + sin nθ j sin θ j Thus one finds that 1 = T r( cos θ j ) b = sin (n+1)θ j cos θ j sin θ j sin (n+1)θ j sin θ j = a k sin (n+1)θj sin θ j (1) Since 0 < θ j / < π and (n + 1)θ j / = (n + 1)jπ/(n + ) can not be an integer multiple of π for any j = 1,, n+1, this lead us to a contradiction as b increases If q = n, then the polynomial r(z) above is r(z) := z q f(z) = bz p,q b (z n 1, z n,, 1) n 1 = b(z n 1 + z n + + 1) a k z k (z n k 1 + 1), a k {0, 1} If n = 1 here, then we read the summation from 1 to 0 as zero Define a polynomial r 1 (z) by r 1 (z) := r(z) z + 1 = b(zn + z n z + 1) n 1 a k z k (z n k z n k 3 + z + 1) Now we find its Chebyshev transform as ( x ) n 1 ( ( x ) ( x )) T r 1 (x) = bu n 1 a k U n k 1 U n k If γ j = e iθ j see that = e jπi/(q+1) is a zero of g for some j = 1,, q, then one can U n k 1 (cos θ j ) U n k (cos θ j ) = sin(n k)θ j sin(n k 1)θ j sin θ j = cos (n k 1)θ j sin θ j sin θ j = cos (n k 1)θj cos θ j () 6
7 Since γ j 1, we can fix some constant M so that M T r 1 ( cos θ j ) b sin nθ j sin θ j a k cos θ j For any j = 1,, n, the number nθ j = njπ/(n + 1) is never an integer multiple of π and the number θ j / = jπ/(n + 1) can not be π/ Now we get a contradiction for every sufficiently large b This completes Part (a) of THEOREM The crucial ingredient in the previous proof is from splitting given a betapolynomial into a reciprocal polynomial and a monomial This technique also works for upper self-christoffel numbers Put f(x) = x q+1 bz p,q b (x q, x q 1,, x) x + 1 and suppose that f(x) = g(x)h(x) over Q and g(β) 0 = h(β) Then the same reasoning as before shows that g is eventually reciprocal as b increases If γ is a zero of g, then γ 1 is also a zero of g Hence one has γ = γ q+1 bz p,q b (γ q, γ q 1,, γ) + 1 = γ q+1 [γ q 1 bz p,q b (γ q, γ q+1,, γ 1 ) + 1] = γ q+1 γ 1 = γ q, which gives γ q 1 = 1 First, we suppose that q = n 1 and γ j = e iθ j g for some j = 1,, q We then put = e jπi/(q 1) is a zero of r(z) := f(z) + z = z n bz p,q b (z n 1, z n,, z) + 1 = z n + z n (b + 1)z(z n + + 1) + a k z k (z n k + 1), a k {0, 1/, 1} The similar arguments to the above derive the Chebyshev transform of r(z) by T r(x) = U n ( x ) ( x ) ( ( x ) ( x )) +U n 1 (b+1) U n 1 + U n + ( x a k T n k Using T n k (cos θ j ) = cos(n k)θ j and Equation (1) one thus finds that sin (n 1)θ j sin (n+1)θ j 1 = T r( cos θ j ) (b + 1) sin θ j sin θ j a k (3) Since 0 < θ j / < π and (n 1)θ j / = (n 1)jπ/(n ) can not be an integer multiple of π for any j = 1,, n 3, we eventually get a 7 )
8 contradiction as b increases If q = n, then we have r(z) := f(z) + z = z n+1 bz p,q b (z n, z n 1,, z) + 1 = z n+1 + z n (b + 1)z(z n ) + a k z k (z n+1 k + 1), a k {0, 1} This can be rewritten in the form, r 1 (z) := r(z) z + 1 = z n + z n + + z + 1 (b + 1)z(z n + z n z + 1) + a k z k (z n k z n k 1 + z + 1) Hence we find ( x ) ( x ) T r 1 (x) = U n (b + 1)U n 1 + ( ( x ) ( x )) a k U n k U n k 1 If γ j = e iθ j = e jπi/(q 1) is a zero of g for some j = 1,, q, then one can verify as in Equation () that U n k (cos θ j ) U n k 1 (cos θ j ) = cos (n k+1)θ j cos θ j Since γ j 1, we can fix some constant M so that M T r 1 ( cos θ j ) (b + 1) sin nθ j sin θ j sin(n + 1)θ j sin θ j a k cos θ j For any j = 1,, n, the number nθ j = njπ/(n 1) is never an integer multiple of π and the number θ j / = jπ/(n 1) can not be π/ Now we get a contradiction for every sufficiently large b 4 Discussion and further studies Suppose that an integer b 1 is divisible by a prime p but not by p Then the Eisenstein Criterion shows that the beta-polynomial of ( bq 1 ) is q irreducible for any q 1 Now we introduce another interesting connection between prime numbers and irreducibility for self-christoffel numbers This is related to Mersenne primes, ie, primes of the form n 1 One of famous open questions in number theory is: 8
9 Are there infinitely many Mersenne primes? We need a classical irreducibility criterion for polynomials in Z[x], which appears for example in [13] Theorem 41 Let β 1,, β n be the zeros of some f(x) Z[x] of degree n If there exists an integer b such that f(b) is prime, f(b 1) 0 and the real parts of zeros satisfy R(β i ) < b 1 for 1 i n, then f(x) is irreducible over Q We consider the beta-polynomials of ( 1) and ( 1 +) Let us denote q q them by fq(x) l and fq u (x) respectively, and take b = Then fq(1) l = fq u (1) = 1 If q 3 then ( 1) < 3, and if q 4 then ( 1+) < 3 Since q q beta-numbers are Perron numbers [10], Condition (4) holds for lower (resp upper) self-christoffel numbers whenever q 3 (resp q 4) We also note that fq() l = q 1 1, fq u () = q 3 Now one can say the following: 1 If there exist infinitely many Mersenne primes, then f l q(x) is irreducible for infinitely many q 3 (4) If there exist infinitely many primes of the form n 3, then f u q (x) is irreducible for infinitely many q 4 Using a computer the author checked the irreducibility of beta-polynomials of self-christoffel numbers To be more precise, suppose α = p/q + b 1, where 1 p < q 00, gcd(p, q) = 1 and 1 b 150 For given 1 p 199, the irreducibility of beta-polynomials of (α) and (α+) q 00 was checked as b runs over 1 b 150 When some beta-polynomial is reducible, the case was recorded as (p, q, b) in a row As a result, a table was obtained, which comprises 564 (resp 34) reducible cases for lower (resp upper) self-christoffel numbers This is too huge to be included here We refer to [17] instead For example, if α = 6 + b 1 then the 11 beta-polynomial of (α) is irreducible for all b = 1,, 4 b 150, and the beta-polynomial of (α+) is irreducible for all b 150 On the other hand, if α = 4 + b 1 then both beta-polynomials of (α) and (α+) are 9 irreducible for all 1 b 150 We will use below this table implicitly 9
10 Suppose α = p/q +b 1 If we follow the proof of THEOREM described in Section 3, then we can find effectively the constant B smallest possible for which b B implies that the beta-polynomial of (α) or (α+) is irreducible This procedure is demonstrated in the next example Example 4 Let us consider the case α = 4 + b 1 and find B for upper 7 self-christoffel number (α+) First we must determine B 1 so that the Mahler measure of g is less than θ 0 given in Theorem 1 One can see that such B 1 is enough for our purpose if it satisfies ( B 1 + ) 5 B1 + 4B 1 < θ 0 B 1 So B 1 17 Second we also find B which contradicts Inequality (3) Computation shows that B 11 Let B 3 = max{b 1, B } = 17 Then b B 3 implies that the beta-polynomial of (( 4 + b 1)+) is irreducible 7 One readily notes that the constant B 3 works not only for 4 but for all 7 1,,, 6 To find the smallest B instead of B , we consult the table [17] It suffices to check whether or not (1, 7, b), (, 7, b),, (6, 7, b) for 1 b 16 are in the list But there are none even for 1 b 150 Now we can state the following (ie, in this case we have the beta-polynomial of (α+) is irreducible for every b B = 1): For any integer p 1 which is not a multiple of 7, the betapolynomial of ( p +) is irreducible 7 Some calculations tempt us to conjecture that all lower self-christoffel numbers are Pisot numbers But this is false as explained below Flatto et al [5] considered the dynamical zeta-function ζ β (z) = exp ( P n n=1 n z n) for the β-transformation T β, where P n is the number of fixed points of Tβ n They formulated it in terms of the β-expansions of 1: 1 If β is not a simple beta-number with d β (1) = e 1 e, then ζ β (z) = 1 1 e iz i If β is a simple beta-number with d β (1) = e 1 e n, then ζ β (z) = 1 z n 1 n e iz i In both cases, ζ β (z) is meromorphic in the open unit disk It has a simple pole at z = 1/β and no other pole in {z : z 1/β} Then M(β) was defined by the second smallest modulus of the poles of ζ β (z) If no pole 10
11 other than 1/β exists in the open unit disk, then M(β) = 1 The main study was the behavior of the function M(β) The next theorem alludes to an abundance of non-pisot lower self-christoffel numbers Theorem 43 ([5]) There exists ɛ > 0 such that M(β) < 1 for every β (1, 1 + ɛ) In particular, if the Mersenne Prime Conjecture is true then there are infinitely many non-pisot lower self-christoffel numbers There still remains a question in this direction Question 1 Let p/q be a fixed rational with 0 < p q and gcd(p, q) = 1 If α = b 1 + p/q for b N, then (α) is eventually a Pisot number as b increases Together with THEOREM, the affirmative answer to Question 1 would produce many concrete examples of irreducible Pisot type beta-substitutions See for details [1] While our main interest in this paper is the irreducible beta-polynomial, Boyd [] focused on the reducible beta-polynomial Specifically, he dealt with the situation where β is a Pisot number It is well known that every Pisot number is a beta-number [15] Let β be a Pisot number and f(x) be the β-polynomial Now we suppose that f(x) = g(x)h(x) is a nontrivial factorization over Q, where h(x) is the minimal polynomial of β Boyd called g(x) the complementary factor Although considerable calculations made some mathematicians suspect that g(x) should be a product of cyclotomic polynomials, Boyd showed by systematic computation that there exist many Pisot numbers β for which their complementary factors are noncyclotomic or even nonreciprocal Motivated by Boyd s work, the author checked the complementary factors of all reducible cases listed in [17] for both lower (564) and upper (34) self-christoffel numbers Surprisingly enough, all the complementary factors are (either cyclotomic polynomials or) products of cyclotomic polynomials For lower self-christoffel numbers in [17], irreducibles of the complementary factors consist of, 3, 4, 5, 6, 7, 8, 9, 10, 1, 14, 15, 16, 18, 0, 1,, 4, 6, 8, and 30 th cyclotomic polynomials only For upper self-christoffel numbers in [17], irreducibles of the complementary factors consist of 1,, 3, 4, 5, 6, 8, 9, 10, 1, and 14 th cyclotomic polynomials only A natural question arises Question For β a lower or an upper self-christoffel number, if the β- polynomial is reducible, then its complementary factor is a product of cyclotomic polynomials 11
12 References [1] V Berthé and A Siegel Tilings associated with beta-numeration and substitution Integers 5(3) (005) A [] DW Boyd On beta-expansions for Pisot numbers Math Comp 65 (1996) [3] JW Cannon and Ph Wagreich Growth functions of surface groups Math Ann 93 (199) [4] DP Chi and DY Kwon Sturmian words, β-shifts, and transcendence Theoret Comput Sci 31 (004) [5] L Flatto, JC Lagarias and B Poonen The zeta function of the beta transformation Ergodic Theory Dynam Systems 14 (1994) [6] DY Kwon A devil s staircase from rotations and irrationality measures for Liouville numbers preprint (004) See [7] DY Kwon Beta-numbers whose conjugates lie near the unit circle Acta Arith 17 (007) [8] P Lakatos On zeros of reciprocal polynomials Publ Math Debrecen 61 (00) [9] DH Lehmer Factorization of certain cyclotomic functions, Ann of Math () 34 (1933) [10] DA Lind The entropies of topological Markov shifts and a related class of algebraic integers Ergodic Theory Dynam Systems 4 (1984) [11] M Lothaire Algebraic combinatorics on words Cambridge University Press, New York, 00 [1] W Parry On the β-expansions of real numbers Acta Math Acad Sci Hungar 11 (1960) [13] G Pólya and G Szegö Problems and theorems in analysis II Springer- Verlag, New York-Heidelberg, 1976 [14] A Rényi Representations for real numbers and their ergodic properties Acta Math Acad Sci Hungar 8 (1957)
13 [15] K Schmidt On periodic expansions of Pisot numbers and Salem numbers Bull London Math Soc 1 (1980) [16] CJ Smyth On the product of the conjugates outside the unit circle of an algebraic integer Bull London Math Soc 3 (1971) [17] DY Kwon Table of reducible beta-polynomials of lower and upper self-christoffel numbers available at Department of Mathematics, Yonsei University, 134 Shinchon-dong, Seodaemun-gu, Seoul , Republic of Korea doyong@yonseiackr 13
ON THE IRREDUCIBILITY OF SUM OF TWO RECIPROCAL POLYNOMIALS
Bull. Korean Math. Soc. 53 (16), No. 3, pp. 833 84 http://dx.doi.org/1.4134/bkms.b15363 pissn: 115-8634 / eissn: 34-316 ON THE IRREDUCIBILITY OF SUM OF TWO RECIPROCAL POLYNOMIALS Minsang Bang and DoYong
More informationON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 151 158 ON THE LIMIT POINTS OF THE FRACTIONAL PARTS OF POWERS OF PISOT NUMBERS ARTŪRAS DUBICKAS Abstract. We consider the sequence of fractional parts {ξα
More informationAuxiliary polynomials for some problems regarding Mahler s measure
ACTA ARITHMETICA 119.1 (2005) Auxiliary polynomials for some problems regarding Mahler s measure by Artūras Dubickas (Vilnius) and Michael J. Mossinghoff (Davidson NC) 1. Introduction. In this paper we
More informationTHE MAHLER MEASURE OF POLYNOMIALS WITH ODD COEFFICIENTS
Bull. London Math. Soc. 36 (2004) 332 338 C 2004 London Mathematical Society DOI: 10.1112/S002460930300287X THE MAHLER MEASURE OF POLYNOMIALS WITH ODD COEFFICIENTS PETER BORWEIN, KEVIN G. HARE and MICHAEL
More informationerm Michael Mossinghoff Davidson College Introduction to Topics 2014 Brown University
Complex Pisot Numbers and Newman Polynomials I erm Michael Mossinghoff Davidson College Introduction to Topics Summer@ICERM 2014 Brown University Mahler s Measure f(z) = nx k=0 a k z k = a n n Y k=1 (z
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS. 1. Introduction
t m Mathematical Publications DOI: 10.2478/tmmp-2013-0023 Tatra Mt. Math. Publ. 56 (2013), 27 33 ALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS Horst Brunotte ABSTRACT. We study algebraic properties of real
More informationOn the β-expansion of an algebraic number in an algebraic base β. (Strasbourg)
On the β-expansion of an algebraic number in an algebraic base β Yann BUGEAUD (Strasbourg) Abstract. Let α in (0, 1] and β > 1 be algebraic numbers. We study the asymptotic behaviour of the function that
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
More informationLecture 6.3: Polynomials and irreducibility
Lecture 6.3: Polynomials and irreducibility Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More informationComplex Pisot Numbers and Newman Representatives
Complex Pisot Numbers and Newman Representatives Zach Blumenstein, Alicia Lamarche, and Spencer Saunders Brown University, Shippensburg University, Regent University Summer@ICERM, August 7, 2014 Blumenstein,
More informationAn Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x]
An Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x] Mark Kozek 1 Introduction. In a recent Monthly note, Saidak [6], improving on a result of Hayes [1], gave Chebyshev-type estimates
More informationUNIMODULAR ROOTS OF RECIPROCAL LITTLEWOOD POLYNOMIALS
J. Korean Math. Soc. 45 (008), No. 3, pp. 835 840 UNIMODULAR ROOTS OF RECIPROCAL LITTLEWOOD POLYNOMIALS Paulius Drungilas Reprinted from the Journal of the Korean Mathematical Society Vol. 45, No. 3, May
More informationPISOT NUMBERS AND CHROMATIC ZEROS. Víctor F. Sirvent 1 Departamento de Matemáticas, Universidad Simón Bolívar, Caracas, Venezuela
#A30 INTEGERS 13 (2013) PISOT NUMBERS AND CHROMATIC ZEROS Víctor F. Sirvent 1 Departamento de Matemáticas, Universidad Simón Bolívar, Caracas, Venezuela vsirvent@usb.ve Received: 12/5/12, Accepted: 3/24/13,
More informationThe values of Mahler measures
The values of Mahler measures John D. Dixon Artūras Dubickas September 28, 2004 Abstract We investigate the set M of numbers which occur as Mahler measures of integer polynomials and the subset M of Mahler
More informationThe Mahler measure of trinomials of height 1
The Mahler measure of trinomials of height 1 Valérie Flammang To cite this version: Valérie Flammang. The Mahler measure of trinomials of height 1. Journal of the Australian Mathematical Society 14 9 pp.1-4.
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationBeta Expansions for Regular Pisot Numbers
Beta Expansions for Regular Pisot Numbers arxiv:1103.2147v1 [math.nt] 10 Mar 2011 Maysum Panju Department of Pure Mathematics University of Waterloo May 29, 2018 Abstract A beta expansion is the analogue
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationApproximation by polynomials with bounded coefficients
Journal of Number Theory 27 (2007) 03 7 www.elsevier.com/locate/jnt Approximation by polynomials with bounded coefficients Toufik Zaimi Département de mathématiques, Centre universitaire Larbi Ben M hidi,
More informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
More informationChebyshev coordinates and Salem numbers
Chebyshev coordinates and Salem numbers S.Capparelli and A. Del Fra arxiv:181.11869v1 [math.co] 31 Dec 018 January 1, 019 Abstract By expressing polynomials in the basis of Chebyshev polynomials, certain
More informationA Systematic Construction of Almost Integers
The Waterloo Mathematics Review 35 A Systematic Construction of Almost Integers Maysum Panju University of Waterloo mhpanju@uwaterloo.ca Abstract: Motivated by the search for almost integers, we describe
More informationTWO VARIATIONS OF A THEOREM OF KRONECKER
TWO VARIATIONS OF A THEOREM OF KRONECKER ARTŪRAS DUBICKAS AND CHRIS SMYTH ABSTRACT. We present two variations of Kronecker s classical result that every nonzero algebraic integer that lies with its conjugates
More informationLa mesure de Mahler supérieure et la question de Lehmer
La mesure de Mahler supérieure et la question de Lehmer Matilde Lalín (joint with Kaneenika Sinha (IISER, Kolkata)) Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/ mlalin Conférence
More informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
More informationComplexity of Knots and Integers FAU Math Day
Complexity of Knots and Integers FAU Math Day April 5, 2014 Part I: Lehmer s question Integers Integers Properties: Ordering (total ordering)..., 3, 2, 1, 0, 1, 2, 3,..., 10,... Integers Properties: Size
More informationMahler measure as special values of L-functions
Mahler measure as special values of L-functions Matilde N. Laĺın Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/~mlalin CRM-ISM Colloquium February 4, 2011 Diophantine equations
More informationSome aspects of the multivariable Mahler measure
Some aspects of the multivariable Mahler measure Séminaire de théorie des nombres de Chevaleret, Institut de mathématiques de Jussieu, Paris, France June 19th, 2006 Matilde N. Lalín Institut des Hautes
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationTHE t-metric MAHLER MEASURES OF SURDS AND RATIONAL NUMBERS
Acta Math. Hungar., 134 4) 2012), 481 498 DOI: 10.1007/s10474-011-0126-y First published online June 17, 2011 THE t-metric MAHLER MEASURES OF SURDS AND RATIONAL NUMBERS J. JANKAUSKAS 1 and C. L. SAMUELS
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationSOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO /4
SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL VALUES GUY KATRIEL PREPRINT NO. 2 2003/4 1 SOLUTION TO RUBEL S QUESTION ABOUT DIFFERENTIALLY ALGEBRAIC DEPENDENCE ON INITIAL
More information8 The Gelfond-Schneider Theorem and Some Related Results
8 The Gelfond-Schneider Theorem and Some Related Results In this section, we begin by stating some results without proofs. In 1900, David Hilbert posed a general problem which included determining whether
More informationDIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS
DIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS A. LASJAUNIAS Avec admiration pour Klaus Roth 1. Introduction and Notation 1.1. The Fields of Power Series F(q) or F(K). Let p be
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
More informationarxiv: v1 [math.nt] 26 Nov 2008
Uniform distribution of Galois conjugates and beta-conjugates of a Parry number near the unit circle and dichotomy of Perron numbers arxiv:0811.4288v1 [math.nt] 26 Nov 2008 Jean-Louis Verger-Gaugry Institut
More informationExplicit solution of a class of quartic Thue equations
ACTA ARITHMETICA LXIV.3 (1993) Explicit solution of a class of quartic Thue equations by Nikos Tzanakis (Iraklion) 1. Introduction. In this paper we deal with the efficient solution of a certain interesting
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationBoris Adamczewski, Christiane Frougny, Anne Siegel & Wolfgang Steiner
RATIONAL NUMBERS WITH PURELY PERIODIC β-expansion by Boris Adamczewski, Christiane Frougny, Anne Siegel & Wolfgang Steiner Abstract. We study real numbers β with the curious property that the β-expansion
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationTHE LIND-LEHMER CONSTANT FOR 3-GROUPS. Stian Clem 1 Cornell University, Ithaca, New York
#A40 INTEGERS 18 2018) THE LIND-LEHMER CONSTANT FOR 3-GROUPS Stian Clem 1 Cornell University, Ithaca, New York sac369@cornell.edu Christopher Pinner Department of Mathematics, Kansas State University,
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationbe a sequence of positive integers with a n+1 a n lim inf n > 2. [α a n] α a n
Rend. Lincei Mat. Appl. 8 (2007), 295 303 Number theory. A transcendence criterion for infinite products, by PIETRO CORVAJA and JAROSLAV HANČL, communicated on May 2007. ABSTRACT. We prove a transcendence
More informationSolutions for Problem Set 6
Solutions for Problem Set 6 A: Find all subfields of Q(ζ 8 ). SOLUTION. All subfields of K must automatically contain Q. Thus, this problem concerns the intermediate fields for the extension K/Q. In a
More informationTHE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS*
THE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS* CLAYTON PETSCHE Abstract. Given a number field k and a non-archimedean place v of k, we give a quantitative lower bound on the height of non-torsion algebraic
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More information250 G. ALKAUSKAS and A. DUBICKAS Baker and Harman [2] proved that the sequence [ο p ] (where p runs over the primes) contains infinitely many prime nu
Acta Math. Hungar. 105 (3) (2004), 249 256. PRIME AND COMPOSITE NUMBERS AS INTEGER PARTS OF POWERS G. ALKAUSKAS and A. DUBICKAS Λ (Vilnius) Abstract. We studyprime and composite numbers in the sequence
More informationProof of a conjecture by Ðoković on the Poincaré series of the invariants of a binary form
Proof of a conjecture by Ðoković on the Poincaré series of the invariants of a binary form A. Blokhuis, A. E. Brouwer, T. Szőnyi Abstract Ðoković [3] gave an algorithm for the computation of the Poincaré
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationTest 2. Monday, November 12, 2018
Test 2 Monday, November 12, 2018 Instructions. The only aids allowed are a hand-held calculator and one cheat sheet, i.e. an 8.5 11 sheet with information written on one side in your own handwriting. No
More informationOn the lines passing through two conjugates of a Salem number
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 On the lines passing through two conjugates of a Salem number By ARTŪRAS DUBICKAS Department of Mathematics and Informatics, Vilnius
More informationarxiv: v6 [math.nt] 12 Sep 2017
Counterexamples to the conjectured transcendence of /α) k, its closed-form summation and extensions to polygamma functions and zeta series arxiv:09.44v6 [math.nt] Sep 07 F. M. S. Lima Institute of Physics,
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
More informationIN CUBIC SALEM BASE IN F q ((X 1 )) Faïza Mahjoub
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100(114) (2016), 279 285 DOI: 10.2298/PIM1614279M PURELY PERIODIC -EXPANSIONS IN CUBIC SALEM BASE IN F q ((X 1 )) Faïza Mahjoub Abstract. Let
More informationFibonacci numbers of the form p a ± p b
Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More informationHomework problems from Chapters IV-VI: answers and solutions
Homework problems from Chapters IV-VI: answers and solutions IV.21.1. In this problem we have to describe the field F of quotients of the domain D. Note that by definition, F is the set of equivalence
More informationSign changes of Fourier coefficients of cusp forms supported on prime power indices
Sign changes of Fourier coefficients of cusp forms supported on prime power indices Winfried Kohnen Mathematisches Institut Universität Heidelberg D-69120 Heidelberg, Germany E-mail: winfried@mathi.uni-heidelberg.de
More informationAutomata for arithmetic Meyer sets
Author manuscript, published in "LATIN 4, Buenos-Aires : Argentine (24)" DOI : 1.17/978-3-54-24698-5_29 Automata for arithmetic Meyer sets Shigeki Akiyama 1, Frédérique Bassino 2, and Christiane Frougny
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationSIX PROBLEMS IN ALGEBRAIC DYNAMICS (UPDATED DECEMBER 2006)
SIX PROBLEMS IN ALGEBRAIC DYNAMICS (UPDATED DECEMBER 2006) THOMAS WARD The notation and terminology used in these problems may be found in the lecture notes [22], and background for all of algebraic dynamics
More informationNUMBER FIELDS WITHOUT SMALL GENERATORS
NUMBER FIELDS WITHOUT SMALL GENERATORS JEFFREY D. VAALER AND MARTIN WIDMER Abstract. Let D > be an integer, and let b = b(d) > be its smallest divisor. We show that there are infinitely many number fields
More informationTo appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.
To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? DE-JUN FENG, SU HUA, AND YUAN JI Abstract. Let U λ be the union of two unit intervals
More informationSection X.55. Cyclotomic Extensions
X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationP -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS. Tomislav Pejković
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 20 = 528 2016): 9-18 P -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS Tomislav Pejković Abstract. We study p-adic root separation for quadratic and cubic
More informationNATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II
NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II Chapter 2 Further properties of analytic functions 21 Local/Global behavior of analytic functions;
More informationAn irreducibility criterion for integer polynomials
An irreducibility criterion for integer polynomials Anuj Jakhar, Neeraj Sangwan arxiv:1612.01712v1 [math.ac] 6 Dec 2016 anujjakhar@iisermohali.ac.in, neerajsan@iisermohali.ac.in Indian Institute of Science
More informationTwists of elliptic curves of rank at least four
1 Twists of elliptic curves of rank at least four K. Rubin 1 Department of Mathematics, University of California at Irvine, Irvine, CA 92697, USA A. Silverberg 2 Department of Mathematics, University of
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationGALOIS THEORY AT WORK: CONCRETE EXAMPLES
GALOIS THEORY AT WORK: CONCRETE EXAMPLES KEITH CONRAD 1. Examples Example 1.1. The field extension Q(, 3)/Q is Galois of degree 4, so its Galois group has order 4. The elements of the Galois group are
More informationDONG QUAN NGOC NGUYEN
REPRESENTATION OF UNITS IN CYCLOTOMIC FUNCTION FIELDS DONG QUAN NGOC NGUYEN Contents 1 Introduction 1 2 Some basic notions 3 21 The Galois group Gal(K /k) 3 22 Representation of integers in O, and the
More informationOn intervals containing full sets of conjugates of algebraic integers
ACTA ARITHMETICA XCI4 (1999) On intervals containing full sets of conjugates of algebraic integers by Artūras Dubickas (Vilnius) 1 Introduction Let α be an algebraic number with a(x α 1 ) (x α d ) as its
More informationdoi: /j.jnt
doi: 10.1016/j.jnt.2012.07.015 DISCRETE SPECTRA AND PISOT NUMBERS SHIGEKI AKIYAMA AND VILMOS KOMORNIK Abstract. By the m-spectrum of a real number q > 1 we mean the set Y m (q) of values p(q) where p runs
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationNotes on Galois Theory
Notes on Galois Theory Paul D. Mitchener October 16, 2007 Contents 1 Introduction 2 2 Extensions 2 3 Euclidean Rings 3 4 Polynomials 4 5 Polynomials with Integer Coefficients 6 6 Algebraic Elements 8 7
More informationChapter Two The transcendence of e and π.
Chapter Two The transcendence of e and π. The fantasy calculation at the end of the last lecture, a fantasy because the linear combination of the intermediate series I n did not vanish it is a positive
More information1. Introduction This paper investigates the properties of Ramanujan polynomials, which, for each k 0, the authors of [2] define to be
ZEROS OF RAMANUJAN POLYNOMIALS M. RAM MURTY, CHRIS SMYTH, AND ROB J. WANG Abstract. In this paper, we investigate the properties of Ramanujan polynomials, a family of reciprocal polynomials with real coefficients
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationA 4 -SEXTIC FIELDS WITH A POWER BASIS. Daniel Eloff, Blair K. Spearman, and Kenneth S. Williams
A 4 -SEXTIC FIELDS WITH A POWER BASIS Daniel Eloff, Blair K. Spearman, and Kenneth S. Williams Abstract. An infinite family of monogenic sextic fields with Galois group A 4 is exhibited. 1. Introduction.
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France
GLASNIK MATEMATIČKI Vol. 44(64)(2009), 323 331 ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS Yann Bugeaud Université de Strasbourg, France Abstract. Let n be a positive integer. Let ξ
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationJeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA
#A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department
More informationMath 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative
Math 259: Introduction to Analytic Number Theory Functions of finite order: product formula and logarithmic derivative This chapter is another review of standard material in complex analysis. See for instance
More informationINTRODUCTION TO TRANSCENDENTAL NUMBERS
INTRODUCTION TO TRANSCENDENTAL NUBERS VO THANH HUAN Abstract. The study of transcendental numbers has developed into an enriching theory and constitutes an important part of mathematics. This report aims
More informationDiscrete dynamics on the real line
Chapter 2 Discrete dynamics on the real line We consider the discrete time dynamical system x n+1 = f(x n ) for a continuous map f : R R. Definitions The forward orbit of x 0 is: O + (x 0 ) = {x 0, f(x
More informationIntroduction to Lucas Sequences
A talk given at Liaoning Normal Univ. (Dec. 14, 017) Introduction to Lucas Sequences Zhi-Wei Sun Nanjing University Nanjing 10093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Dec. 14, 017
More informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationFrom the definition of a surface, each point has a neighbourhood U and a homeomorphism. U : ϕ U(U U ) ϕ U (U U )
3 Riemann surfaces 3.1 Definitions and examples From the definition of a surface, each point has a neighbourhood U and a homeomorphism ϕ U from U to an open set V in R 2. If two such neighbourhoods U,
More informationA parametric family of quartic Thue equations
A parametric family of quartic Thue equations Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the Diophantine equation x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3 + y 4 = 1, where c
More information