3 problems
Matching
Parry-power conjecture. For every , is Parry, and for every integer , is non-Parry.
Non-Parry powers conjecture. For every and every integer , the power is non-Parry.
Dynamical strong Lehmer conjecture. If is a Perron number, then is a Parry number for only finitely many integers .