Parry order of Parry numbers
Kevin G Hare, Hachem Hichri

TL;DR
This paper introduces the Parry order to classify Perron numbers based on their powers being Parry numbers, revealing structural insights and connections to Salem and Pisot numbers.
Contribution
It defines the Parry order, characterizes Perron numbers with infinitely many Parry powers, and provides bounds and examples illustrating the structure of these classes.
Findings
Perron numbers have infinitely many Parry powers iff they are Pisot or Salem.
Explicit upper bounds on Parry order in terms of algebraic properties.
Existence of non-Parry Perron numbers with powers becoming Parry, showing richness of classes.
Abstract
We introduce the \emph{Parry order} , defined as the largest integer for which is a Parry number. This leads to a natural partition of the set of Perron numbers as follows: \[ \mathcal{P} = \left( \bigcup_{n \geq 0} H_n \right) \cup H_\infty, \] where is the class of Perron numbers with Parry order , and consists exactly of all Pisot and Salem numbers. We show that a Perron number has infinitely many Parry powers if and only if it is Pisot or Salem. For every other Perron number, only finitely many powers can be Parry. We give an explicit upper bound on in terms of algebraic properties of~. We provide explicit examples of non-Parry Perron numbers whose powers become Parry, demonstrating that several are non-empty and structurally rich. We give an infinite family of cubic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · Logic, programming, and type systems
