Monogenic Strictly-Perron Polynomials

Abstract

A monic polynomial f(x)∈ Z[x] of degree n is called monogenic if f(x) is irreducible over Q and \1,θ,θ2,… ,θn-1\ is a basis for the ring of integers of Q(θ), where f(θ)=0. A strictly-Perron polynomial is the minimal polynomial of a Perron number λ such that λ is neither a Pisot number, an anti-Pisot number, nor a Salem number. For any natural number n 2, we prove that there exist infinitely many monogenic strictly-Perron polynomials of degree n.

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…