English

Monogenic Strictly-Perron Polynomials

Number Theory 2025-08-27 v1

Abstract

A monic polynomial f(x)Z[x]f(x)\in {\mathbb Z}[x] of degree nn is called monogenic if f(x)f(x) is irreducible over Q{\mathbb Q} and {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. A strictly-Perron polynomial is the minimal polynomial of a Perron number λ\lambda such that λ\lambda is neither a Pisot number, an anti-Pisot number, nor a Salem number. For any natural number n2n\ge 2, we prove that there exist infinitely many monogenic strictly-Perron polynomials of degree nn.

Keywords

Cite

@article{arxiv.2508.18946,
  title  = {Monogenic Strictly-Perron Polynomials},
  author = {Lenny Jones},
  journal= {arXiv preprint arXiv:2508.18946},
  year   = {2025}
}
R2 v1 2026-07-01T05:06:19.328Z