On the co-factors of degree 6 Salem number beta expansions

Abstract

For [Formula: see text], a sequence [Formula: see text] with [Formula: see text] is the beta expansion of [Formula: see text] with respect to [Formula: see text] if [Formula: see text]. Defining [Formula: see text] to be the greedy beta expansion of [Formula: see text] with respect to [Formula: see text], it is known that [Formula: see text] is eventually periodic as long as [Formula: see text] is a Pisot number. It is conjectured that the same is true for Salem numbers, but is only currently known to be true for Salem numbers of degree 4. Heuristic arguments suggest that almost all degree 6 Salem numbers admit periodic expansions but that a positive proportion of degree 8 Salem numbers do not. In this paper, we investigate the degree 6 case. We present computational methods for searching for families of degree 6 numbers with eventually periodic greedy expansions by studying the co-factors of their expansions. We also prove that the greedy expansions of degree 6 Salem numbers can have arbitrarily large periods. In addition, computational evidence is compiled on the set of degree 6 Salem numbers with [Formula: see text]. We give examples of numbers with [Formula: see text] whose expansions have period and preperiod lengths exceeding [Formula: see text], yet are still eventually periodic.