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.
PDF Access Denied
We have not been able to recognize your IP address
18.97.9.170
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.