The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an m-continued fraction converge to a multi-formal Laurent series, and are best rational approximations to it; conversely for any multi-formal Laurent series an algorithm called m-CF transform is introduced to obtain its m-continued fraction expansions; moreover, strict m-continued fractions, which are m-continued fractions imposed with some additional conditions, and multi-formal Laurent series are in 1-1 correspondence. It is shown that m-continued fractions can be used to study the multi-sequence synthesis problem.
We give a new class of multidimensional $p$-adic continued fraction algorithms. We propose an algorithm in the class for which we can expect that multidimensional $p$-adic version of Lagrange's Theorem holds.
Most well-known multidimensional continued fractions, including the Mönkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by permuting the vertices of these triangles before and after each subdivision. We obtain an even larger class of multidimensional continued fractions by composing the maps in the family. These include the algorithms of Brun, Parry-Daniels and Güting. We give criteria for when multidimensional continued fractions associate sequences to unique points, which allows us to d…
The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization arising from an algorithm due to Jacobi, have been poorly investigated in this sense, up to now. In this paper, we propose a combinatorial interpretation of the convergents of multidimensional continued fractions in terms of counting some particular tilings, generalizing some results that hold for classical continued fractions.
This work is devoted to the proof of the statement about the existence of palindromic continued fractions in an arbitrary dimension. In addition, it is proved the criterion that an algebraic continued fraction has proper cyclic palindromic symmetry in the case $n = 4$. Klein polyhedra are considered as a multidimensional generalization of continued fractions.
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 particular, we prove that partial quotients of a multidimensional continued fraction are periodic if and only if numerato…
The Lagrange theorem on continued fractions states that a number is a quadratic surd if and only if its continued fraction expansion is eventually periodic. The current paper is devoted to a multidimensional generalization of this fact. As a multidimensional analog of continued fractions so called Klein polyhedra are considered: given an irrational lattice in an n-dimensional Euclidean space, its Klein polyhedron is defined as the convex hull of nonzero lattice points with nonnegative coordinates.
We consider the geometric generalization of ordinary continued fraction to the multidimensional case introduced by F. Klein in 1895. A multidimensional periodic continued fraction is the union of sails with some special group acting freely on these sails. This group transposes the faces. In this article, we present a method of constructing "approximate" fundamental domains of algebraic multidimensional continued fractions and an algorithm testing whether this domain is indeed fundamental or not. We give some polynomial estimates on number of the operations for the algorithm. In conclusion we p…
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.
The Gauss-Kuzmin statistics for the triangle map (a type of multidimensional continued fraction algorithm) are derived by examining the leading eigenfunction of the triangle map's transfer operator. The technical difficulty is finding the appropriate Banach space of functions. We also show that, by thinking of the triangle map's transfer operator as acting on a one-dimensional family of Hilbert spaces, the transfer can be thought of as a family of nuclear operators of trace class zero.
The Minkowski question mark function, maping the unit interval to itself, is a continuous, strictly increasing, one-to-one and onto function that has derivative zero almost everywhere. Key to these facts are the basic properties of continued fractions. Thus the question mark function is a naturally occurring number theoretic singular function. This paper generalizes the question mark function to the 216 triangle partition (TRIP) maps. These are multidimensional continued fractions which generate a family of almost all known multidimensional continued fractions. We show for each TRIP map that t…
It is known that the continued fraction expansion of a real number is periodic if and only if the number is a quadratic irrational. In an attempt to generalize this phenomenon to other settings, Jun-Ichi Tamura and Shin-Ichi Yasutomi have developed a new algorithm for multidimensional continued fractions (Algebraic Jacobi-Perron algorithm) that involves cubic irrationals, and proved periodicity in some cubic number fields, such as $\mathbb{Q}(\sqrt[3]{m^3+1})$ where $m\in\mathbb{Z}$, and $\mathbb{Q}(δ_m)$ where $δ_m$ is a root of $x^3-mx+1=0,\,\,m\in\mathbb{Z},\,\, m\geq3$ with the algorithm. …
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the triangle sequence. We give a new criterion for when a triangle sequence uniquely describes a pair of numbers and give the first explicit examples of triangle sequences that do not uniquely describe a pair of reals. Finally, this dual approach yields that the triangle sequence is topologically strongly mixing, meaning in particular that it is topologically erg…
Unlike the real case, there are not many studies and general techniques for providing simultaneous approximations in the field of $p$--adic numbers $\mathbb Q_p$. Here, we study the use of multidimensional continued fractions (MCFs) in this context. MCFs were introduced in $\mathbb R$ by Jacobi and Perron as a generalization of continued fractions and they have been recently defined also in $\mathbb Q_p$. We focus on the dimension two and study the quality of the simultaneous approximation to two $p$-adic numbers provided by $p$-adic MCFs, where $p$ is an odd prime. Moreover, given algebraical…
In this paper we study the three-dimensional analogue of the relation between the irrationality exponent of a real number and the growth of its regular continued fraction partial quotients. As a multidimensional generalisation of continued fractions, we consider Klein polyhedra.
Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to generalize the classical continued fractions. In this paper, we propose an introductive fundamental study about MCFs in the field of the $p$--adic numbers $\mathbb Q_p$. First, we introduce them from a formal point of view, i.e., without considering a specific algorithm that produces the partial quotients of a MCF, and we perform a general study about their convergence in $\mathbb Q_p$. In particular, we derive some conditions about their convergence and we prove that convergent MCFs always strongly co…
We study the strong convergence of certain multidimensional continued fraction algorithms. In particular, in the two-dimensional case, we prove that the second Lyapunov exponent of Selmer's algorithm is negative and bound it away from zero. Moreover, we give heuristic results on several other continued fraction algorithms. Our results indicate that all classical multidimensional continued fraction algorithms cease to be strongly convergent for high dimensions. The only exception seems to be the Arnoux-Rauzy algorithm which, however, is defined only on a set of measure zero.
In the current paper we prove simplicity for the spectrum of Lyapunov exponents for triangle sequence and Selmer algorithm in dimension 3. We introduce a strategy that can be applied for a wide class of Markovian MCF.
In this work we prove a criterion for an algebraic continued fraction to have a proper palindromic symmetry in dimension $4$. As a multidimensional generalization of continued fractions, we consider Klein polyhedra.
In this paper we develop an integer-affine classification of three-dimensional multistory completely empty convex marked pyramids. We apply it to obtain the complete lists of compact two-dimensional faces of multidimensional continued fractions lying in planes with integer distances to the origin equal 2, 3, 4 ... The faces are considered up to the action of the group of integer-linear transformations. In conclusion we formulate some actual unsolved problems associated with the generalizations for n-dimensional faces and more complicated face configurations.
The Minkowski Question Mark function can be characterized as the unique homeomorphism of the real unit interval that conjugates the Farey map with the tent map. We construct an n-dimensional analogue of the Minkowski function as the only homeomorphism of an n-simplex that conjugates the piecewise-fractional map associated to the Monkemeyer continued fraction algorithm with an appropriate tent map.
The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued fractions, called multidimensional continued fractions, can be produced through various subdivisions of a triangle. We define triangle partition-Stern sequences (TRIP-Stern sequences for short), higher-dimensional generalizations of the Stern diatomic sequence, from the method of subdividing a triangle via various triangle partition algorithms. We then explore seve…
Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular multidimensional continued fraction algorithm (the Farey algorithm), we will generalize the diatomic sequence to a collection of numbers that quite naturally should be called the triatomic sequence (or a two-dimensional Pascal with memory sequence). As continued fractions and the diatomic sequence can be thought of as coming from systematic subdivisions of the unit interv…
This paper is a direct continuation of "Functional analysis behind a Family of Multidimensional Continued Fractions: Part I," in which we started the exploration of the functional analysis behind the transfer operators for triangle partition maps, a family that includes many, if not most, well-known multidimensional continued fraction algorithms. This allows us now to find eigenfunctions of eigenvalue 1 for transfer operators associated with select triangle partition maps on specified Banach spaces. We proceed to prove that the transfer operators, viewed as acting on one-dimensional families o…
In this paper we prove in detail a criterion for an algebraic continued fraction to have a proper palindromic symmetry in dimension $4$. We also present a new proof of the criterion for an algebraic continued fraction to have a proper cyclic palindromic symmetry in dimension $4$. As a multidimensional generalization of continued fractions, we consider Klein polyhedra.
Consider the representation of a rational number as a continued fraction, associated with "odd" Euclidean algorithm. In this paper we prove certain properties for the limit distribution function for sequences of rationals with bounded sum of partial quotients
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
Triangle partition maps form a family that includes many, if not most, well-known multidimensional continued fraction algorithms. This paper begins the exploration of the functional analysis behind the transfer operator of each of these maps. We show that triangle partition maps give rise to two classes of transfer operators and present theorems regarding the origin of these classes; we also present related theorems on the form of transfer operators arising from compositions of triangle partition maps. In the next paper, Part II, we will find eigenfunctions of eigenvalue 1 for transfer operato…
In this paper we describe the group of symmetries of a two-dimensional continued fraction. As a multidimensional generalization of continued fractions we consider Klein polyhedra. We distinguish two types of symmetries: the Dirichlet-type ones, that correspond to the multiplication by units of the corresponding number field, and so called palindromic ones. The main result of the paper is a criterion for a two-dimensional continued fraction to have a palindromic symmetry. This criterion is analogous to the criterion for the period of a quadratic irrationality to be symmetric.
Let $x$ be a periodic continued fraction with the initial block $0$ and the repeating block $c_1,\ldots,c_n$. So $x$ is a quadratic irrational of the form $x=a+\sqrt b$, where $a$, $b$ are rational numbers, $b>0$, $b$ not a square. The numbers $a$ and $\sqrt b$ are uniquely determined by $x$. In general it is difficult to say what the influence of a certain digit of the repeating block on the appearance of $x$ is. We highlight a noteworthy exception from this rule. Indeed, the magnitude of $2a$ is essentially determined by the last digit $c_n$ of the repeating block, the fractional part of $2a…
We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the numerators and the denominators of the convergents of that generalized continued fraction.
We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a, a-a^2) is purely periodic with respect to an element in the family. These cubic irrationals seem to be quite natural, as we show that, for every cubic number field, there exists a pair (u,u') with u a unit in the cubic number field (or possibly the quadratic extension of the cubic number field by the square root of the discriminant) such that (u,u') has a perio…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced from a geometrical quality of the algorithm. Some refercences are given to the works of various authors, in the domain of multidimensional continued fractions algorithms.
This note describes continued fraction representations for the rational approximations to the zeta function recently found by the author. It is tempting to think that these continued fractions might be analysed using a souped up version of the Worpitzky argument so as to produce zero-free regions for the approximations.
The continued logarithm algorithm was introduced by Gosper around 1978, and recently studied by Borwein, Calkin, Lindstrom, and Mattingly. In this note I show that the continued logarithm algorithm terminates in at most 2 log_2 p + O(1) steps on input a rational number p/q >= 1. Furthermore, this bound is tight, up to an additive constant.
In this article, for a certain subset $\mathcal{X}$ of the extended set of rational numbers, we introduce the notion of {\it best $\mathcal{X}$-approximations} of a real number. The notion of best $\mathcal{X}$-approximation is analogous to that of best rational approximation. We explore these approximations with the help of $\mathcal{F}_{p^l}$-continued fractions, where $p$ is a prime and $l\in\mathbb{N}$, we show that the convergents of the $\mathcal{F}_{p^l}$-continued fraction expansion of a real number $x$ satisfying certain maximal conditions are exactly the best $\mathcal{F}_{p^l}$-appr…
In this paper we define "a continued fraction expansion of the exponential integral $E_{1}(x)$ at infinity", which is analogous to the regular continued fraction expansion of real numbers, and prove that this expansion gives the same continued fraction. Moreover, we give concrete representations of rational functions which are obtained by truncating the continued fraction.
Rational approximations to a square root $\sqrt{k}$ can be produced by iterating the transformation $f(x) = (dx+k)/(x+d)$ starting from $\infty$ for any positive integer $d$. We show that these approximations coincide infinitely often with continued fraction convergents if and only if $4d^2/(k-d^2)$ is an integer, in which case the continued fraction has a rich structure. It consists of the concatenation of the continued fractions of certain explicitly definable rational numbers, and it belongs to one of infinitely many families of continued fractions whose terms vary linearly in two parameter…
We establish an equidistribution result for push-forwards of certain locally finite algebraic measures in the adelic extension of the space of lattices in the plane. As an application of our analysis we obtain new results regarding the asymptotic normality of the continued fraction expansions of most rationals with a high denominator as well as an estimate on the length of their continued fraction expansions. By similar methods we also establish a complementary result to Zaremba's conjecture. Namely, we show that given a bound M, for any large q, the number of rationals $p/q\in [0,1]$ for whic…
We introduce a notion of $q$-deformed rational numbers and $q$-deformed continued fractions. A $q$-deformed rational is encoded by a triangulation of a polygon and can be computed recursively. The recursive formula is analogous to the $q$-deformed Pascal identitiy for the Gaussian binomial coefficients, but the Pascal triangle is replaced by the Farey graph. The coefficients of the polynomials defining the $q$-rational count quiver subrepresentations of the maximal indecomposable representation of the graph dual to the triangulation. Several other properties, such as total positivity propertie…
We exhibit a method to use continued fractions in function fields to find new families of hyperelliptic curves over the rationals with given torsion order in their Jacobians. To show the utility of the method, we exhibit a new infinite family of curves over $\mathbb Q$ with genus two whose Jacobians have torsion order eleven. {\bf In this updated version, we correct an error in the initial paper:} The ``new" family claimed in the original Theorem~1 was pointed out by Professor D.~Lorenzini to have elements isomorphic with elements in Flynn's family (as defined in the paper); his guess that the…
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(ψ)$ of complex numbers which are well approximated with the given bound $ψ$ and have quite different Hurwitz contin…
For a monic polynomial $D(X)$ of even degree, express $\sqrt D$ as a Laurent series in $X^{-1}$; this yields a continued fraction expansion (similar to continued fractions of real numbers): \[\sqrt D=a_0+\dfrac{1}{a_1+\dfrac{1}{a_2+\dfrac{1}{\ddots}}},\quad a_i\text{ polynomials in }X.\] Such continued fractions were first considered by Abel in 1826, and later by Chebyshev. It turns out they are rarely periodic unless $D$ is defined over a finite field. Around 2001 van der Poorten studied non-periodic continued fractions of $\sqrt D$, with $D$ defined over the rationals, and simultaneously the…
We discuss the form of certain algebraic continued fractions in the field of power series over $F_p$, where p is an odd prime number. This leads to give explicit continued fractions in these fields, satisfying an explicit algebraic equation of arbitrary degree $d\geq 2$ and having an irrationality measure equal to $d$. Our results are based on a mysterious finite sequence of rational numbers.
In this paper the properties of Rédei rational functions are used to derive rational approximations for square roots and both Newton and Padé approximations are given as particular cases. As a consequence, such approximations can be derived directly by power matrices. Moreover, Rédei rational functions are introduced as convergents of particular periodic continued fractions and are applied for approximating square roots in the field of p-adic numbers and to study periodic representations. Using the results over the real numbers, we show how to construct periodic continued fractions and approxi…
We provide several asymptotic expansions of the prime counting function $π(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly divergent continued fraction whose approximants provide an asymptotic expansion of the given function. We show that, for each positive integer $n$, two well-known continued fraction expansions of the exponential integral function $E_n(z)$ correspondingly yield two asymptotic continued fraction expansions of $π(x)/x$. We prove this by first establishing some gen…
We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmodα$ has the solution $β$ with $0 < β< α$ if and only if $α/β$ has a continued fraction expansion with sequence of quotients having one of a finite number of possible asymmetry types. This generalizes the old theorem that a rational number $α/β> 1$ in lowest terms has a symmetric continued fraction precisely when $β^2 \equiv \pm 1 \pmodα$.
We discuss a proposal for a continued fraction-like algorithm to determine simultaneous rational approximations to $d$ real numbers $α_1,\ldots,α_d$. It combines an algorithm of Hermite and Lagarias with ideas from LLL-reduction. We dynamically LLL-reduce a quadratic form with parameter $t$ as $t\downarrow0$. The new idea in this paper is that checking the LLL-conditions consists of solving linear equations in $t$.
A seminal result due to Wall states that if $x$ is normal to a given base $b$ then so is $rx+s$ for any rational numbers $r,s$ with $r\neq 0$. We show that a stronger result is true for normality with respect to the continued fraction expansion. In particular, suppose $a,b,c,d\in \mathbb{Z}$ with $ad-bc\neq 0$. Then if $x$ is continued fraction normal, so is $(ax+b)/(cx+d)$.
