Monogenic fields arising from trinomials

DOI10.2140/INVOLVE.2022.15.299MaRDI QIDQ6324209arXivFDO

Authors Ryan Ibarra, Henry Lembeck, Mohammad Ozaslan, Hanson Smith, Katherine E. Stange

Publication date 26 August 2019

Published in arXiv

Full work available at URL https://doi.org/10.2140/INVOLVE.2022.15.299

Mathematics Subject Classification ID

Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Algebraic numbers; rings of algebraic integers (11R04)

arXiv classification

math.NT

Abstract: We call a polynomial monogenic if a root $heta$ has the property that $mathbbZ[heta]$ is the full ring of integers in $mathbbQ(heta)$. Consider the two families of trinomials $x^n+ax+b$ and $x^n+c{x}^{n-1}+d$. For any $n>2$, we show that these families are monogenic infinitely often and give some positive densities in terms of the coefficients. When $n=5$ or 6 and when a certain factor of the discriminant is square-free, we use the Montes algorithm to establish necessary and sufficient conditions for monogeneity, illuminating more general criteria given by Jakhar, Khanduja, and Sangwan using other methods. Along the way we remark on the equivalence of certain aspects of the Montes algorithm and Dedekind's index criterion.

This page was built for publication: Monogenic fields arising from trinomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324209)