An Elementary Problem in Galois Theory about the Roots of Irreducible Polynomials
Abstract
For a field , and a root of an irreducible polynomial over (in some algebraic closure) the number of roots of lying in is studied here. Given such an of degree for which of the roots are i n , we describe a construction that yields, for , irreducible polynomials of degree and with exactly of the roots in the field generated by any one root of those polynomials. Our results are valid for all number fields and possibly some more perfect fields. As an application, for and positive integers , we provide irreducible polynomials of degree with exactly roots in the field generated by one of the roots. Independently, for , we construct irreducible polynomials over the rationals of degree for which the field generated by one root contains exactly roots. Many interesting new questions for further research are provided.
Keywords
Cite
@article{arxiv.2310.13880,
title = {An Elementary Problem in Galois Theory about the Roots of Irreducible Polynomials},
author = {M Krithika and P Vanchinathan},
journal= {arXiv preprint arXiv:2310.13880},
year = {2024}
}
Comments
Changes in Version 3: (i) generalization from Q to any number field (ii) Additional section at end providing Examples and SAGE code. Changes in Version 2: an error in the proof in version 1 corrected; changed the title (previous title was "Root Clusters..."). No more revisions planned!