𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exponential and Continued Fractions

✍ Scribed by Dinesh S Thakur


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
329 KB
Volume
59
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis


We show that the simple continued fractions for the analogues of (ae 2Γ‚n +b)Γ‚(ce 2Γ‚n +d ) in function fields, with the usual exponential replaced by the exponential for F q [t] have very interesting patterns. These are quite different from their classical counterparts. We also show some continued fraction expansions coming from function field analogues of hypergeometric functions 1996 Academic Press, Inc.

On the other hand, nobody has made any sense out of the pattern for ?. (We restrict our attention to simple continued fractions: of course, there are many generalized continued fractions with nice patterns for numbers article no.


πŸ“œ SIMILAR VOLUMES


Continued Fractions and Series
✍ L.E. Clemens; K.D. Merrill; D.W. Roeder πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 359 KB
Matrix Continued Fractions
✍ Vladimir N. Sorokin; Jeannette Van Iseghem πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 167 KB

A matrix continued fraction is defined and used for the approximation of a function F known as a power series in 1Γ‚z with matrix coefficients p\_q, or equivalently by a matrix of functions holomorphic at infinity. It is a generalization of P-fractions, and the sequence of convergents converges to th

Continued Fractions and Generalized Patt
✍ Toufik Mansour πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 140 KB

Babson and Steingrimsson (2000, SΓ©minaire Lotharingien de Combinatoire, B44b, 18) introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Let f Ο„ ;r (n) be the number of 1-3-2-avoiding permutations on n lett

Heap-ordered Trees, 2-Partitions and Con
✍ Wen-Chin Chen; Wen-Chun Ni πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 139 KB

This paper studies the enumerations and some interesting combinatorial properties of heap-ordered trees (HOTs). We first derive analytically the total numbers of \(n\)-node HOTs. We then show that there exists a 1-1 and onto correspondence between any two of the following four sets: the set of \((n+

Transcendence of Sturmian or Morphic Con
✍ J.-P. Allouche; J.L. Davison; M. QueffΓ©lec; L.Q. Zamboni πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 244 KB

We prove, using a theorem of W. Schmidt, that if the sequence of partial quotients of the continued fraction expansion of a positive irrational real number takes only two values, and begins with arbitrary long blocks which are ''almost squares,'' then this number is either quadratic or transcendenta