2000 character limit reached
Monogenic Cyclic Polynomials in Recurrence Sequences
Published 14 May 2025 in math.NT | (2505.09481v1)
Abstract: Let $f(x)\in {\mathbb Z}[x]$ be an $N$th degree polynomial that is monic and irreducible over ${\mathbb Q}$. We say that $f(x)$ is {\em monogenic} if ${1,\theta,\theta2,\ldots ,\theta{N-1}}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where $f(\theta)=0$. We say that $f(x)$ is {\em cyclic} if the Galois group of $f(x)$ over ${\mathbb Q}$ is the cyclic group of order $N$. In this article, we investigate the appearance of monogenic cyclic polynomials in certain polynomial recurrence sequences.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.