A continued fraction of order twelve

In this paper, we establish several explicit evaluations, reciprocity theorems and integral representations for a continued fraction of order twelve which are analogues to Rogers-Ramanujan’s continued fraction and Ramanujan’s cubic continued fraction.      

Geodesic continued fractions and LLL

We discuss a proposal for a continued fraction-like algorithm to determine simultaneous rational approximations to d$d$ real numbers _α1,…,_αd${\alpha }_1,\dots ,{\alpha }_d$. It combines an algorithm of Hermite and Lagarias with ideas from LLL-reduction. We dynamically LLL-reduce a quadratic form with parameter t$t$ as t↓0$t\downarrow 0$. Suggestions in this direction have been made several times over in the literature, e.g. Chevallier (2013) [4] or Bosma and Smeets (2013) [2]. The new idea in this paper is that checking the LLL-conditions consists of solving linear equations in t$t$.     

Singular values of the Rogers-Ramanujan continued fraction

Let z∊ C be imaginary quadratic in the upper half plane. Then the Rogers-Ramanujan continued fraction evaluated at q = e ^{2π iz} is contained in a class field of Q(z). Ramanujan showed that for certain values of z, one can write these continued fractions as nested radicals. We use the Shimura reciprocity law to obtain such nested radicals whenever z is imaginary quadratic. 2000 Mathematics Subject Classification Primary—11Y65; Secondary—11Y40     

Some general theorems on the explicit evaluations of Ramanujan''s cubic continued fraction

In 2001, Jinhee Yi found many explicit values of the famous Rogers–Ramanujan continued fraction by using modular equations and transformation formulas for theta-functions. In this paper, we use her method to find some general theorems for the explicit evaluations of Ramanujan's cubic continued fraction.     

A simple algorithm for expanding a power series as a continued fraction

I present and discuss an extremely simple algorithm for expanding a formal power series as a continued fraction. This algorithm, which goes back to Euler (1746) and Viscovatov (1805), deserves to be better known. I also discuss the connection of this algorithm with the work of Gauss (1812), Stieltjes (1889), Rogers (1907) and Ramanujan, and a combinatorial interpretation based on the work of Flajolet (1980).     

On an asymptotic series and corresponding continued fraction for a gamma function ratio

Recurrence relations for the coefficients in the asymptotic expansion of a gamma function ratio are derived and a property of these coefficients is proved. The Stieltjes fraction for the series is given and a characteristic of the partial numerators is explained. A connection between the continued fraction and the error of a particular least squares approximation problem is discussed.     

Some theta function identities related to the Rogers-Ramanujan continued fraction

In his first and second letters to Hardy, Ramanujan made several assertions about the Rogers-Ramanujan continued fraction . In order to prove some of these claims, G. N. Watson established two important theorems about that he found in Ramanujan's notebooks. In his lost notebook, after stating a version of the quintuple product identity, Ramanujan offers three theta function identities, two of which contain as special cases the celebrated two theorems of Ramanujan proved by Watson. Using addition formulas, the quintuple product identity, and a new general product formula for theta functions, we prove these three identities of Ramanujan from his lost notebooks.

     

A method of convergence acceleration of some continued fractions

A new method of convergence acceleration is proposed for continued fractions , where and are polynomials in (, ) for sufficiently large. It uses the fact that the modified approximant approaches the continued fraction value, if is sufficiently close to the th tail . Presented method is of iterative character; in each step, by means of an approximation , it produces a new better approximation of the th tail . Formula for is very simple and contains only arithmetical operations. Hence described algorithm is fully rational.     

Explicit evaluations of a Ramanujan-Selberg continued fraction

This paper gives explicit evaluations for a Ramanujan-Selberg continued fraction in terms of class invariants and singular moduli.

     

Abundant periodic and aperiodic solutions of a discontinuous three-term recurrence relation

In this note, we study a discontinuous three-term recurrence relation which arises from seeking the steady states of a cellular neural network with step control function. Several collections of periodic solutions are found. A necessary and sufficient condition for a solution to be periodic is stated and aperiodic solutions are found as consequences. We also show that any periodic solution can be derived from a primary periodic solution with least period not divisible by 5. Although the periodic or aperiodic solutions we found are not exhaustive, they are quite abundant and may reflect some of the rich physical phenomena in true biological systems. Our method in this note may also provide a general approach to analyze the periodicity of solutions of similar recurrence relations.     

A lower bound for linear forms in values of a continued fraction

Let y = y(x) be a function defined by a continued fraction. A lower bound for |Λ| = |β ₁ y ₁ + β ₂ y ₂ + α| is given, where y ₁ = y(x ₁), y ₂ = y(x ₂), x ₁ and x ₂ are positive integers, α, β ₁ and β ₂ are algebraic irrational numbers.     

Analysis of generalized continued fraction algorithms over polynomials

We study and compare natural generalizations of Euclid's algorithm for polynomials with coefficients in a finite field. This leads to gcd algorithms together with their associated continued fraction maps. The gcd algorithms act on triples of polynomials and rely on two-dimensional versions of the Brun, Jacobi–Perron and fully subtractive continued fraction maps, respectively. We first provide a unified framework for these algorithms and their associated continued fraction maps. We then analyse various costs for the gcd algorithms, including the number of iterations and two versions of the bit-complexity, corresponding to two representations of polynomials (the usual and the sparse one). We also study the associated two-dimensional continued fraction maps and prove the invariance and the ergodicity of the Haar measure. We deduce corresponding estimates for the costs of truncated trajectories under the action of these continued fraction maps, obtained thanks to their transfer operators, and we compare the two models (gcd algorithms and their associated continued fraction maps). Proving that the generating functions appear as dominant eigenvalues of the transfer operator allows indeed a fine comparison between the models.     

Generating functions for vector partition functions and a basic recurrence relation

ABSTRACT

We define a generalized vector partition function and derive an identity for the generating series of such functions associated with solutions to basic recurrence relations of combinatorial analysis. As a consequence we obtain the generating function of the number of generalized lattice paths and a new version of the Chaundy-Bullard identity for the vector partition function.     

The multidimensional cube recurrence

We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and Goncharov and the three-dimensional cube recurrence studied by Fomin and Zelevinsky, and Carroll and Speyer. The states of this recurrence are indexed by tilings of a polygon with rhombi, and the variables in the recurrence are indexed by vertices of these tilings. We travel from one state of the recurrence to another by performing elementary flips. We show that the values of the recurrence are independent of the order in which we perform the flips; this proof involves nontrivial combinatorial results about rhombus tilings which may be of independent interest. We then show that the multidimensional cube recurrence exhibits the Laurent phenomenon - any variable is given by a Laurent polynomial in the other variables. We recognize a special case of the multidimensional cube recurrence as giving explicit equations for the isotropic Grassmannians IG(n−1,2n). Finally, we describe a tropical version of the multidimensional cube recurrence and show that, like the tropical octahedron recurrence, it propagates certain linear inequalities.     

Quantitative Poincaré recurrence in continued fraction dynamical system

Let T:X → X be a transformation.For any x ∈[0,1) and r > 0,the recurrence time τr(x) of x under T in its r-neighborhood is defined as τr(x)=inf k 1:d (Tk(x),x) < r.For 0 αβ∞,let E(α,β) be the set of points with prescribed recurrence time as follows E (α,β)=x ∈ X:lim r→0 inf[log τr(x)/-log r]=α,lim r→0 sup[log τr(x)/-log r]=β.In this note,we consider the Gauss transformation T on [0,1),and determine the size of E (α,β) by showing that dim H E (α,β)=1 no matter what α and β are.This can be compared with Feng and Wu’s result [Nonlinearity,14 (2001),81-85] on the symbolic space.     

VECTOR VALUED RATIONAL INTERPOLANTS BY TRIPLE BRANCHED CONTINUED FRACTIONS

Triple branched continued fractions (TBCFs) are constructed by means of well-define Thiele-type partial inverted differences. The characterizatioon theorem, uniqueness theorem andsome projection identity properties are obtained for vector valued rational interpolants hy TBCFs.     

A distributional limit law for the continued fraction digit sum

We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalised fluctuation process of the digit sums converges strongly distributional to a random variable uniformly distributed on the unit interval. For this process normalised linearly we determine a large deviation asymptotic. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)