Monogenic Cyclic Polynomials in Recurrence Sequences

Abstract

Let f(x)∈ Z[x] be an Nth degree polynomial that is monic and irreducible over Q. We say that f(x) is monogenic if \1,θ,θ2,… ,θN-1\ is a basis for the ring of integers of Q(θ), where f(θ)=0. We say that f(x) is cyclic if the Galois group of f(x) over Q is the cyclic group of order N. In this article, we investigate the appearance of monogenic cyclic polynomials in certain polynomial recurrence sequences.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…