Cyclotomic Matrices Over Quadratic Integer Rings
Total Page:16
File Type:pdf, Size:1020Kb
Cyclotomic Matrices over Quadratic Integer Rings Gary Greaves Thesis submitted to the University of London for the degree of Doctor of Philosophy 2012 Declaration of Authorship I, Gary Greaves, hereby declare that this thesis and the work presented in it is entirely my own. Where I have consulted the work of others, this is always clearly stated. Signed: (Gary Greaves) Date: Summary This thesis has been motivated largely by Lehmer’s problem [20], which was stated in 1933 and it is still a problem that mathematicians have not completely solved. The Mersenne n sequence, (2 1)n N, has properties that make it useful for finding large primes but its terms become− very2 large very fast. Lehmer’s problem is related to finding large primes in sequences that are analogous to the Mersenne sequence but that grow as slowly as possible and Lehmer’s conjecture implies a lower bound on the growth rate of any such sequence. Lehmer’s problem is usually stated in terms of a geometric constraint on the zeros of polynomials having integer coefficients and top coefficient 1. Breusch [4] and Smyth [38] have reduced the problem to one where it is only necessary to consider a much smaller class of polynomials. Some recent progress has been made on this restricted version of Lehmer’s problem by associating some of the polynomials of this smaller class to combinatorial objects. The characteristic polynomial χA (x) of a matrix A is taken to be det(x I A). For an n n integer symmetric matrix A we define its associated polynomial as − × n RA (z ) := z χA (z + 1=z ). A Hermitian matrix A is called cyclotomic if all of the zeros of RA lie on the unit circle. McKee and Smyth [26] showed that Lehmer’s conjecture holds for the polynomials RA for all integer symmetric matrices A. Their method involved first classifying all cyclotomic integer symmetric matrices. McKee [23] used the classification of cyclotomic integer symmetric matrices to classify certain polynomials (which he called small-span polynomials) that are also characteristic polynomials of integer symmetric matrices. A large part of my research has involved developing the method of McKee and Smyth of associating algebraic numbers to combinatorial objects. The main results are the following. 1. The classification of cyclotomic matrices over the Eisenstein and Gaussian integers. 2. The classification of cyclotomic matrices over real quadratic integer rings. 3. Reducing to a finite search the proof that Lehmer’s conjecture holds for polynomials RA for all Hermitian matrices A over the Eisenstein and Gaussian integers. 4. Confirmation that Lehmer’s conjecture holds for polynomials RA for all real sym- metric matrices A over real quadratic integer rings. 5. The classification of small-span polynomials that are also characteristic polynomials of Hermitian matrices over quadratic integer rings. 3 Acknowledgments To my supervisor James McKee from whom I have learnt so much and whose patience, advice, and support have been invaluable to me. To the EPSRC and the Heilbronn insti- tute for their funding which enabled me to go to various conferences and meetings. In particular, I found it very useful to discuss my research in Edinburgh with Chris Smyth and Graeme Taylor. To the mathematics department whose inhabitants, past and present, have created an open and friendly atmosphere. To Laurence for finding typos and to Anastasia, Ciaran, Kenny, Max, and Millie for musical interludes. To my friends for keeping me aware of life outside of the mathematics department. And finally, to my family for their love. I extend my deepest gratitude. 4 Contents 1 Introduction 9 1.1 Boyd and Lehmer . 9 1.2 Simple graphs . 11 1.3 Integer symmetric matrices . 13 1.4 Recurrent themes . 15 2 Radical Integer Trees 19 2.1 Cyclotomics . 19 2.2 Minimal non-cyclotomics . 22 2.3 Coxeter systems . 28 2.4 Unfolding trees . 30 2.5 Boyd’s conjecture . 34 3 Hermitian Matrices over Imaginary Quadratic Integer Rings 40 3.1 Cyclotomic matrices over Z[i ] and Z[!] ......................... 40 3.2 Excluded subgraphs and Gram matrices . 45 3.3 Proof of Theorem 3.1 . 48 3.4 Proof of Theorem 3.2 . 57 3.5 Proof of Theorem 3.3 . 62 3.6 The Eisenstein integers . 69 3.7 Lehmer’s problem . 71 4 Hermitian Matrices over Real Quadratic Integer Rings 78 4.1 Integral characteristic polynomials . 78 4.2 Classification of cyclotomic R-matrices . 79 4.3 Proof of Theorem 4.3 . 83 4.4 Applying Perron-Frobenius theory . 89 4.5 Lehmer’s problem . 94 5 Small-Span Hermitian Matrices over Quadratic Integer Rings 102 5.1 Orientation . 102 5.2 Computation of small-span matrices of up to 8 rows . 103 5.3 Maximal small-span infinite families . 113 5.4 Missing small-span polynomials . 121 Bibliography 123 5 List of Figures 1.1 Extended simply-laced Coxeter graphs . 12 ˜ ˜ ˜ ˜ 2.1 The maximal cyclotomic radical integer trees A1, Bn (n ¾ 3), Cn (n ¾ 2), Dn (n ¾ ˜ ˜ ˜ ˜ ˜ 4), E6, E7, E8, F4, and G2. The numbers on the vertices correspond to eigen- vectors with largest eigenvalue 2. The number of vertices is one more than the subscript. 21 2.2 The 9 minimal non-cyclotomic simple trees. 22 2.3 The minimal non-cyclotomic radical integer trees on more than 2 vertices with at least one irrational edge-weight. 23 2.4 Positive semidefinite Coxeter graphs. The number of vertices is one more than the subscript. 29 (x) 3.1 The families T2k and T2k (respectively) of 2k -vertex maximal connected cyclo- tomic Z[x]-graphs, for k ¾ 3 and x i ,! . (The two copies of vertices A and B should be identified to give a toral2 ftessellation.)g . 42 3.2 The family of 2k -vertex maximal connected cyclotomic Z[i ]-graphs C2k for k ¾ 2...................................................... 42 ++ 3.3 The families of 2k -vertex maximal connected cyclotomic Z-graphs C2k and + C2k− for k ¾ 2................................................ 42 3.4 The family of (2k +1)-vertex maximal connected cyclotomic Z[i ]-graphs C2k +1 for k ¾ 1.................................................... 42 3.5 The sporadic maximal connected cyclotomic Z[!]-graphs S10, S12, and S14 of orders 10, 12, and 14 respectively. The Z-graph S14 is also a Z[i ]-graph. 43 3.6 The sporadic maximal connected cyclotomic Z-hypercube S16. 43 3.7 The sporadic maximal connected cyclotomic Z[!]-graphs of orders 1, 2, 4, 5, and 6. The Z-graphs S1 and S2 are also Z[i ]-graphs. 43 3.8 The sporadic maximal connected cyclotomic Z[i ]-graphs of orders 4, 7, and 8. The Z-graphs S7, S8, and S08 are also Z[!]-graphs. 43 3.9 some non-cyclotomic uncharged Z-graphs. 48 3.10 some cyclotomic Z[i ]-graphs that are contained as subgraphs of fixed maximal connected cyclotomic Z[i ]-graphs. 48 3.11 some non-cyclotomic uncharged Z[i ]-graphs. 58 3.12 some cyclotomic Z[i ]-graphs that are contained as subgraphs of fixed maximal connected cyclotomic Z[i ]-graphs. 58 3.13 some non-cyclotomic charged Z[i ]-graphs. 63 3.14 some charged cyclotomic Z[i ]-graphs that are contained as subgraphs of fixed maximal connected cyclotomic Z[i ]-graphs. 63 3.15 some cyclotomic Z[!]-graphs that are contained as subgraphs of fixed maxi- mal connected cyclotomic Z[!]-graphs. 69 6 List of Figures 3.16 some non-cyclotomic charged Z[!]-graphs. 71 3.17 some charged cyclotomic Z[!]-graphs that are contained as subgraphs of fixed maximal connected cyclotomic Z[!]-graphs. 71 3.18 Some Z[i ]-graphs that are not subgraphs of any non-supersporadic graph having at least 5 vertices. 72 3.19 Some Z[i ]-graphs that are not subgraphs of any non-supersporadic graph on at least 10 vertices. 75 4.1 The family T2k of 2k -vertex maximal connected cyclotomic Z-graphs, for k ¾ 3. (The two copies of vertices A and B should be identified to give a toral tessellation.) . 80 4.2 The family of 2k -vertex maximal connected cyclotomic Z[p2]-graphs C2k for k ¾ 2...................................................... 80 ++ 4.3 The families of 2k -vertex maximal connected cyclotomic Z-graphs C2k and + C2k− for k ¾ 2................................................ 80 4.4 The family of (2k + 1)-vertex maximal connected cyclotomic Z[p2]-graphs C2k +1 for k ¾ 1............................................... 80 4.5 The sporadic maximal connected cyclotomic Z-graph S14 of order 14. 80 4.6 The sporadic maximal connected cyclotomic Z-hypercube S16. 81 4.7 The sporadic maximal connected cyclotomic R-graphs of orders 1, 2, 3 and 4. 81 4.8 The sporadic maximal connected cyclotomic R-graphs of orders 6, 7, and 8. 81 4.9 some non-cyclotomic Z[p2]-graphs. 83 4.10 some cyclotomic Z[p2]-graphs that are contained as subgraphs of fixed maxi- mal connected cyclotomic Z[p2]-graphs. 84 4.11 Four infinite families of nonnegative cyclotomic Z[p2]-graphs each having spectral radius 2. The numbers on the vertices correspond to an eigenvector with largest eigenvalue 2. The subscript is the number of vertices. 90 5.1 The infinite family T2k of 2k -vertex maximal connected cyclotomic templates. (The two copies of vertices A and B should be identified to give a toral tessella- tion.) . 114 5.2 The infinite family of 2k -vertex maximal connected cyclotomic templates C2k C and 20 k (respectively) for k ¾ 2. 115 5.3 The infinite family of (2k +1)-vertex maximal connected cyclotomic templates C2k +1 for k ¾ 1. .............................................. 115 5.4 Cyclotomic templates having span equal to 4. In the first three templates, the subscript denotes the number of vertices.