Search arXivSearch

arXiv · 1912.10386

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

Abstract

For $β> 1$, a sequence $(c_n)_{n \geq 1} \in \mathbb{Z}^{\mathbb{N}^+}$ with $0 \leq c_n < β$ is the \emph{beta expansion} of $x$ with respect to $β$ if $x = \sum_{n = 1}^\infty c_nβ^{-n}$. Defining $d_β(x)$ to be the greedy beta expansion of $x$ with respect to $β$, it is known that $d_β(1)$ is eventually periodic as long as $β$ 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 $\text{trace}(β) \leq 15$. We give examples of numbers with $\text{trace}(β) \leq 15$ whose expansions have period and preperiod lengths exceeding $10^{10}$, yet are still eventually periodic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jacob J. Stockton. 2019-12-22. On the co-factors of degree 6 Salem number beta expansions. https://arxiv.org/abs/1912.10386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT