On the Monogenity of Polynomials with Non-Squarefree Discriminants
Abstract
In 2012, for any integer n 2, Kedlaya constructed an infinite class of monic irreducible polynomials of degree n with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by extending Kedlaya's approach, for any odd prime q, Jones constructed a class of degree q polynomials with non-squarefree discriminants. In this article, using a similar method provided by Jones, we present another infinite class of monogenic polynomials of degree q with non-squarefree discriminants, where q is a prime of the form q = q0 + q1 - 1 , with q0 and q1 being prime numbers. In addition to this we present a class of non-monogenic polynomials whose coefficients are Sterling numbers of the first kind.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.