English

Monogenic Cyclic Polynomials in Recurrence Sequences

Number Theory 2025-05-15 v1

Abstract

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

Keywords

Cite

@article{arxiv.2505.09481,
  title  = {Monogenic Cyclic Polynomials in Recurrence Sequences},
  author = {Joshua Harrington and Lenny Jones},
  journal= {arXiv preprint arXiv:2505.09481},
  year   = {2025}
}
R2 v1 2026-06-28T23:33:12.680Z