We call a polynomial
monogenic if a root
has the property that
is the full ring of integers
of
. Consider the two
families of trinomials
and
. For
any
,
we show that these families are monogenic infinitely often and
give some positive densities in terms of the coefficients. When
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.
Keywords
monogenic, power integral basis, ring of integers,
trinomial