Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the co-factors of degree 6 Salem number beta expansions
81
0
0.0
(
0
)
Authors
Jacob J. Stockton
Ask ChatGPT about the research
No Arabic abstract
For $beta > 1$, a sequence $(c_n)_{n geq 1} in mathbb{Z}^{mathbb{N}^+}$ with $0 leq c_n < beta$ is the emph{beta expansion} of $x$ with respect to $beta$ if $x = sum_{n = 1}^infty c_nbeta^{-n}$. Defining $d_beta(x)$ to be the greedy beta expansion of $x$ with respect to $beta$, it is known that $d_beta(1)$ is eventually periodic as long as $beta$ 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}(beta) leq 15$. We give examples of numbers with $text{trace}(beta) leq 15$ whose expansions have period and preperiod lengths exceeding $10^{10}$, yet are still eventually periodic.
rate research
Read More
A beta expansion is the analogue of the base 10 representation of a real number, where the base may be a non-integer. Although the greedy beta expansion of 1 using a non-integer base is in general infinitely long and non-repeating, it is known that if the base is a Pisot number, then this expansion will always be finite or periodic. Some work has been done to learn more about these expansions, but in general these expansions were not explicitly known. In this paper, we present a complete list of the greedy beta expansions of 1 where the base is any regular Pisot number less than 2, revealing a variety of remarkable patterns. We also answer a conjecture of Boyds regarding cyclotomic co-factors for greedy expansions.
We consider the summatory function of the number of prime factors for integers $leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg Martin conjectured that the difference of the summatory functions should attain a constant sign for all sufficiently large $x$. In this paper, we provide strong evidence for Greg Martins conjecture. Moreover, we derive a general theorem for arithmetic functions from the Selberg class.
For regular continued fraction, if a real number $x$ and its rational approximation $p/q$ satisfying $|x-p/q|<1/q^2$, then, after deleting the last integer of the partial quotients of $p/q$, the sequence of the remaining partial quotients is a prefix of that of $x$. In this paper, we show that the situation is completely different if we consider the Hurwitz continued fraction expansions of a complex number and its rational approximations. More specifically, we consider the set $E(psi)$ of complex numbers which are well approximated with the given bound $psi$ and have quite different Hurwitz continued fraction expansions from that of their rational approximations. The Hausdorff and packing dimensions of such set are determined. It turns out that its packing dimension is always full for any given approximation bound $psi$ and its Hausdorff dimension is equal to that of the $psi$-approximable set $W(psi)$ of complex numbers. As a consequence, we also obtain an analogue of the classical Jarnik Theorem in real case.
Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)equiv 0mod n$ is uniformly distributed. as a parallel of Hooleys theorem under ideal theoretical setting, we prove the uniformity of the distribution of residues of an algebraic number modulo degree one ideals. Then using this result we show that the roots of a system of polynomial congruences are uniformly distributed. Finally, the distribution of digits of n-adic expansions of an algebraic number is discussed.
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f in mathbb{Z}[x]$. We use an explicit version of Mertens theorem for number fields to estimate a related sum over rational primes. For a given $f in mathbb{Z}[x]$, our result yields a finite list of primes that certifies the number of distinct irreducible factors of $f$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
