Integer Symmetric Matrices: Counterexamples to Estes-Guralnick's conjecture. / Yatsyna, Pavlo.

2016. 138 p.

Research output: ThesisDoctoral Thesis

Unpublished

Standard

Integer Symmetric Matrices: Counterexamples to Estes-Guralnick's conjecture. / Yatsyna, Pavlo.

2016. 138 p.

Research output: ThesisDoctoral Thesis

Harvard

APA

Vancouver

Author

BibTeX

@phdthesis{9748a642a141456db8df588b3f65cf83,
title = "Integer Symmetric Matrices: Counterexamples to Estes-Guralnick's conjecture",
abstract = "The aim of this thesis is to study which polynomials appear as minimal polynomials of integer symmetric matrices. It has been known for a long time that to be the minimal polynomial of a rational symmetric matrix it is necessary and sufficient that the polynomial is monic, separable and has only real roots. It was conjectured by Estes and Guralnick that the equivalent conditions should hold for integer symmetric matrices.We present counterexamples to Estes--Guralnick's conjecture for every degree strictly larger than five. In the process, we construct Salem numbers of trace $-2$ for every even degree strictly larger than $22$. Furthermore, we settle the Schur--Siegel--Smyth trace problem for polynomials that appear as minimal polynomials of integer symmetric matrices or integer oscillatory matrices. ",
author = "Pavlo Yatsyna",
year = "2016",
language = "English",
school = "Royal Holloway, University of London",

}

RIS

TY - THES

T1 - Integer Symmetric Matrices: Counterexamples to Estes-Guralnick's conjecture

AU - Yatsyna, Pavlo

PY - 2016

Y1 - 2016

N2 - The aim of this thesis is to study which polynomials appear as minimal polynomials of integer symmetric matrices. It has been known for a long time that to be the minimal polynomial of a rational symmetric matrix it is necessary and sufficient that the polynomial is monic, separable and has only real roots. It was conjectured by Estes and Guralnick that the equivalent conditions should hold for integer symmetric matrices.We present counterexamples to Estes--Guralnick's conjecture for every degree strictly larger than five. In the process, we construct Salem numbers of trace $-2$ for every even degree strictly larger than $22$. Furthermore, we settle the Schur--Siegel--Smyth trace problem for polynomials that appear as minimal polynomials of integer symmetric matrices or integer oscillatory matrices.

AB - The aim of this thesis is to study which polynomials appear as minimal polynomials of integer symmetric matrices. It has been known for a long time that to be the minimal polynomial of a rational symmetric matrix it is necessary and sufficient that the polynomial is monic, separable and has only real roots. It was conjectured by Estes and Guralnick that the equivalent conditions should hold for integer symmetric matrices.We present counterexamples to Estes--Guralnick's conjecture for every degree strictly larger than five. In the process, we construct Salem numbers of trace $-2$ for every even degree strictly larger than $22$. Furthermore, we settle the Schur--Siegel--Smyth trace problem for polynomials that appear as minimal polynomials of integer symmetric matrices or integer oscillatory matrices.

M3 - Doctoral Thesis

ER -