On periodic sequences for algebraic numbers

In this article we further develop methods for representing integers as a sum of three cubes. In particular, a barrier to solving the case $k=3$, which was outlined in a previous paper of the second author, is overcome. A very recent computation indicates that the method is quite favourable to other methods in terms of time estimates. A hybrid of the method presented here and those in a previous paper is currently underway for unsolved cases.

Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that provides a periodic multidimensional continued fraction when algebraic irrationalities are given as inputs. In this paper, we provide a characterization for periodicity of Jacobi--Perron algorithm by means of linear recurrence sequences. In p...

The purpose of this book is to provide an introduction to period theory and then to place it within the matrix of recursive function theory.

Recently a new class of continued fraction algorithms, the $(N,\alpha$)-expansions, was introduced for each $N\in\mathbb{N}$, $N\geq 2$ and $\alpha \in (0,\sqrt{N}-1]$. Each of these continued fraction algorithms has only finitely many possible digits. These $(N,\alpha)$-expansions `behave' very different from many other (classical) continued fraction algorithms. In this paper we will show that when all digits in the digit set are co-prime with $N$, which occurs in specified ...

The goal of this paper is to derive a simple recursion that generates a sequence of fractions approximating $\sqrt[n]{k}$ with increasing accuracy. The recursion is defined in terms of a series of first-order non-linear difference equations and then analyzed as a discrete dynamical system. Convergence behavior is then discussed in the language of initial trajectories and eigenvectors, effectively proving convergence without notions from standard analysis of infinitesimals.

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any $k\in\mathbb N$, let $\mathcal B_k$ denote the set of $q$ such that there exists $x$ with exactly $k$ expansions in base $q$. In [12] it was shown that $\min\mathcal B_2=q_2\approx 1.71064$, the appropriate root of $x^{4}=2x^{2}+x+1$. In this ...

The $3x+1$ map $T$ is defined on the $2$-adic integers $\mathbb{Z}_2$ by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. It is still unproved that under iteration of $T$ the trajectory of any rational $2$-adic integer is eventually cyclic. A $2$-adic integer is rational if and only if its representation with $1$'s and $0$'s is eventually periodic. We prove that the $3x+1$ conjugacy $\Phi$ maps aperiodic $v\in\mathbb{Z}_2$ onto aperiodic $2$-adic integers provided tha...

We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling substitutions) for any stepped surface for any cubic direction.

This paper is a continuation of previous work of the authors. We extend one of the theorems that gave a way to construct equilateral triangles whose vertices have integer coordinates to the general situation. An approximate extrapolation formula for the sequence ET(n) of all equilateral triangles with vertices in $\{0,1,2,...,n\}^3$ (A 102698) is given and the asymptotic behavior of this sequence is analyzed.

Several conjectural continued fractions found with the help of various algorithms are published in this paper.