Hankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series

Similar documents
Symmetric Inclusion-Exclusion

Combinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada

Is Analysis Necessary?

Chapter Generating Functions

Generating Functions

INFINITE SEQUENCES AND SERIES

Generating Function Notes , Fall 2005, Prof. Peter Shor

Ira M. Gessel Department of Mathematics, Brandeis University, P.O. Box 9110, Waltham, MA Revised September 30, 1988

A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!

(part 3) Algèbres d opérateurs et Physique combinatoire. Xavier Viennot CNRS, LaBRI, Bordeaux

2.2 Separable Equations

2 J. ZENG THEOREM 1. In the ring of formal power series of x the following identities hold : (1:4) 1 + X n1 =1 S q [n; ]a x n = 1 ax? aq x 2 b x? +1 x

MY PUTNAM PROBLEMS. log(1 + x) dx = π2

arxiv:math-ph/ v2 22 Dec 2004

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

Sec 4.1 Limits, Informally. When we calculated f (x), we first started with the difference quotient. f(x + h) f(x) h

Generating Functions

arxiv: v1 [math.ca] 7 Mar 2013

Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0

Integration of Rational Functions by Partial Fractions

Evaluating a Determinant

Generating Functions

Integration of Rational Functions by Partial Fractions

Applications. More Counting Problems. Complexity of Algorithms

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form

A Catalan-Hankel Determinant Evaluation

Free Meixner distributions and random matrices

CALCULUS JIA-MING (FRANK) LIOU

Scientific Computing

Introduction to orthogonal polynomials. Michael Anshelevich

Measures, orthogonal polynomials, and continued fractions. Michael Anshelevich

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

Linearization coefficients for orthogonal polynomials. Michael Anshelevich

Algebra 2 (2006) Correlation of the ALEKS Course Algebra 2 to the California Content Standards for Algebra 2

Review session Midterm 1

The WZ method and zeta function identities

Taylor and Maclaurin Series. Copyright Cengage Learning. All rights reserved.

Rook theory and simplicial complexes

Measures, orthogonal polynomials, and continued fractions. Michael Anshelevich

Almost Product Evaluation of Hankel Determinants

Lucas Polynomials and Power Sums

Introduction to Orthogonal Polynomials: Definition and basic properties

Prentice Hall: Algebra 2 with Trigonometry 2006 Correlated to: California Mathematics Content Standards for Algebra II (Grades 9-12)

Series Solution of Linear Ordinary Differential Equations

Numerical Analysis: Interpolation Part 1

NOTES ON LINEAR ALGEBRA. 1. Determinants

where c R and the content of f is one. 1

Combinatorial proofs of addition formulas

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

On certain combinatorial expansions of the Legendre-Stirling numbers

Quadrant marked mesh patterns in alternating permutations

Combinatorial Analysis of the Geometric Series

+ i sin. + i sin. = 2 cos

q xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Chapter 11 - Sequences and Series

Counting points on hyperelliptic curves

Some Review Problems for Exam 3: Solutions

Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Inverses. Stephen Boyd. EE103 Stanford University. October 28, 2017

TEST CODE: MMA (Objective type) 2015 SYLLABUS

An Introduction to Combinatorial Species

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Applied Calculus I. Lecture 29

Section 33 Finite fields

Legendre s Equation. PHYS Southern Illinois University. October 18, 2016

Matrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...

and the compositional inverse when it exists is A.

18. Cyclotomic polynomials II

Ma 530 Power Series II

Exponential tail inequalities for eigenvalues of random matrices

0.1 Rational Canonical Forms

Linear Transformations: Standard Matrix

Algebra and Trigonometry 2006 (Foerster) Correlated to: Washington Mathematics Standards, Algebra 2 (2008)

QUADRANT MARKED MESH PATTERNS IN 132-AVOIDING PERMUTATIONS III

CROSSINGS, MOTZKIN PATHS AND MOMENTS

Power series and Taylor series

q-binomial coefficient congruences

Functions, Graphs, Equations and Inequalities

Homework 8 Solutions to Selected Problems

Lecture 22: Jordan canonical form of upper-triangular matrices (1)

FINITE-DIMENSIONAL LINEAR ALGEBRA

Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

A description of a math circle set of activities around polynomials, especially interpolation.

BMT 2016 Orthogonal Polynomials 12 March Welcome to the power round! This year s topic is the theory of orthogonal polynomials.

Simplifying Rational Expressions and Functions

For more information visit

1 The distributive law

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MA22S3 Summary Sheet: Ordinary Differential Equations

Cyclic Derangements. Sami H. Assaf. Department of Mathematics MIT, Cambridge, MA 02139, USA

1. General Vector Spaces

Congruences for algebraic sequences

BOOK REVIEWS 297 WILLIAM D. SUDDERTH American Mathematical Society /85 $ $.25 per page

Math review. Math review

Two-boundary lattice paths and parking functions

There are two things that are particularly nice about the first basis

ENUMERATION BY KERNEL POSITIONS

Transcription:

Hankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series Ira M. Gessel with Jiang Zeng and Guoce Xin LaBRI June 8, 2007

Continued fractions and Hankel determinants There is a close relationship between continued fractions, Hankel determinants, and orthogonal polynomials.

Continued fractions and Hankel determinants There is a close relationship between continued fractions, Hankel determinants, and orthogonal polynomials. Why are we interested in these things?

Continued fractions and Hankel determinants There is a close relationship between continued fractions, Hankel determinants, and orthogonal polynomials. Why are we interested in these things? Continued fractions count certain weighted Motzkin paths which encode objects of enumerative interest such as partitions and permutations. Flajolet)

Continued fractions and Hankel determinants There is a close relationship between continued fractions, Hankel determinants, and orthogonal polynomials. Why are we interested in these things? Continued fractions count certain weighted Motzkin paths which encode objects of enumerative interest such as partitions and permutations. Flajolet) Hankel determinants arise in some enumeration problems, for example, counting certain kinds of tilings or alternating sign matrices.

Orthogonal polynomials A sequence of polynomials p n x) ) n 0, where p nx) has degree n, is orthogonal if there is a linear functional L on polynomials such that L p m x)p n x) ) = 0 for m n, but L p m x) 2) 0. We will assume that L1) = 1.

Orthogonal polynomials A sequence of polynomials p n x) ) n 0, where p nx) has degree n, is orthogonal if there is a linear functional L on polynomials such that L p m x)p n x) ) = 0 for m n, but L p m x) 2) 0. We will assume that L1) = 1. The moments of the sequence p n x) ) are µ n = Lx n ).

Orthogonal polynomials A sequence of polynomials p n x) ) n 0, where p nx) has degree n, is orthogonal if there is a linear functional L on polynomials such that L p m x)p n x) ) = 0 for m n, but L p m x) 2) 0. We will assume that L1) = 1. The moments of the sequence p n x) ) are µ n = Lx n ). So µ 0 = 1.

Orthogonal polynomials A sequence of polynomials p n x) ) n 0, where p nx) has degree n, is orthogonal if there is a linear functional L on polynomials such that L p m x)p n x) ) = 0 for m n, but L p m x) 2) 0. We will assume that L1) = 1. The moments of the sequence p n x) ) are µ n = Lx n ). So µ 0 = 1. Theorem. The sequence p n x) ) of monic polynomials is orthogonal if and only if there exist numbers a n )n 0 and bn ) n 1, with b n 0 for all n 1 such that xp n x) = p n+1 x) + a n p n x) + b n p n 1 x), n 1 with p 0 x) = 1 and p 1 x) = x a 0.

The connection We then have the continued fraction µ k x k = k=0 1 b 1 x 2 1 a 0 x b 2 x 2 1 a 1 x 1 a 2 x and the Hankel determinant detµ i+j ) 0 i,j<n is equal to b n 1 1 b n 2 2 bn 2 2 b 1.

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials?

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them...

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them... except the moments.

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them... except the moments. What are the moments of the classical orthogonal polynomials?

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them... except the moments. What are the moments of the classical orthogonal polynomials? What are their generating functions?

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them... except the moments. What are the moments of the classical orthogonal polynomials? What are their generating functions? Why do some, but not all of them, have nice exponential generating functions?

If we re interested in Hankel determinants or continued fractions, what good are the orthogonal polynomials? There is a systematic treatment of all the classical orthogonal polynomials, that have explicit expressions as hypergeometric series, called the Askey scheme. In a comprehensive paper or web site) by Koekoek and Swarttouw, you can look up all of these orthogonal polynomials and find out everything you might want to know about them... except the moments. What are the moments of the classical orthogonal polynomials? What are their generating functions? Why do some, but not all of them, have nice exponential generating functions? What are the orthogonal polynomials whose moments are the Genocchi numbers?

How do we find the moments of a sequence of orthogonal polynomials? The key is to find numbers α 0, α 1, α 2,... such that we can evaluate L x + α 0 )x + α 1 ) x + α k ) ) for each k. Usually this isn t too hard to do.)

How do we find the moments of a sequence of orthogonal polynomials? The key is to find numbers α 0, α 1, α 2,... such that we can evaluate L x + α 0 )x + α 1 ) x + α k ) ) for each k. Usually this isn t too hard to do.) We then apply the following Lemma: t n x+α 0 )x+α 1 ) x+α n 1 ) 1 + α 0 t) 1 + α n t) = 1 1 xt. Proof. We have the indefinite sum m t n x + α 0 ) x + α n 1 ) 1 + α 0 t) 1 + α n t) = 1 [ t m+1 ] 1 x + α 0 ) x + α n ), 1 xt 1 + α 0 t) 1 + α n t) which is easily proved by induction. The lemma follows by taking m.

Now suppose that L x + α 0 )x + α 1 ) x + α n 1 ) ) = M n. We apply L to t n x+α 0 )x+α 1 ) x+α n 1 ) 1 + α 0 t) 1 + α n t) = 1 1 xt. to get M n t n 1 + α 0 t) 1 + α n t) = L = 1 ) 1 xt Lx k )t k = k=0 µ k t k. k=0

Let s look at an example. First, the standard notation: α) n = αα + 1) α + n 1) ) a1,..., a p pf q b 1,..., b p z a 1 ) n a p ) n = z n n! b 1 ) n b q ) n The Hahn polynomials are defined by Q n x; α, β, N) = 3 F 2 n, n + α + β + 1, x α + 1, N ) 1 They are orthogonal with respect to the linear functional L given by L px) ) N ) ) α + x β + N x = px), x N x x=0 By applying Vandermonde s theorem we find that L x + α + 1) k ) = α + β + 2) N N! α + 1) k α + β + 2 + N) k α + β + 2) k.

Since we want L1) to be 1, we normalize this by dividing L by α + β + 2) N /N!. This is independent of k.) Then with our new normalization, L x + α + 1) k ) = α + 1) k α + β + 2 + N) k α + β + 2) k. Since the right side is a rational function of α, β, and N, we don t need N to be a nonnegative integer and we can therefore make a change of variables, α = A 1, β = C A 1, N = B C. Then L x +A) n ) = L x +A)x +A+n) x +A+n 1) ) = A) n B) n C) n. Now we can apply our lemma to get the ordinary generating function for the moments µ n of the Hahn polynomials: µ n t n = A) n B) n C) n t n n j=0 1 + A + j)t).

This can be written as a rather strange-looking hypergeometric series 1 A) n B n ) 1 + At C) n 1 + A + t 1 = 1 ) A, B, 1 ) n 1 + At 3 F 2 C, 1 + A + t 1 1.

This can be written as a rather strange-looking hypergeometric series 1 A) n B n ) 1 + At C) n 1 + A + t 1 = 1 ) A, B, 1 ) n 1 + At 3 F 2 C, 1 + A + t 1 1. How do we get an exponential generating function for the moments?

This can be written as a rather strange-looking hypergeometric series 1 A) n B n ) 1 + At C) n 1 + A + t 1 = 1 ) A, B, 1 ) n 1 + At 3 F 2 C, 1 + A + t 1 1. How do we get an exponential generating function for the moments? We define a linear operator ε on formal power series by ) ε u n t n = u n t n n!.

This can be written as a rather strange-looking hypergeometric series 1 A) n B n ) 1 + At C) n 1 + A + t 1 = 1 ) A, B, 1 ) n 1 + At 3 F 2 C, 1 + A + t 1 1. How do we get an exponential generating function for the moments? We define a linear operator ε on formal power series by ) ε u n t n = Then we apply ε to µ nt n. u n t n n!.

Lemma. t n ) ε = e At 1 e t ) n. 1 + At)1 + A + 1)t) 1 + A + n)t) n! Proof #1. Expand the left side by partial fractions and the right side by the binomial theorem. Proof #2. Without explicitly computing the partial fraction on the left, we can see that it will be a linear combination of e At, e A+1)t,..., e A+n)t and the first nonzero term is t n /n!. The right side is the only possibility.

Lemma. t n ) ε = e At 1 e t ) n. 1 + At)1 + A + 1)t) 1 + A + n)t) n! Proof #1. Expand the left side by partial fractions and the right side by the binomial theorem. Proof #2. Without explicitly computing the partial fraction on the left, we can see that it will be a linear combination of e At, e A+1)t,..., e A+n)t and the first nonzero term is t n /n!. The right side is the only possibility. Now we apply the lemma to µ n t n = A) n B) n C) n t n n j=0 1 + A + j)t).

We have µ n t n n! = A) n B) n e At 1 e t ) n C) n n! ) 1 e t. = e At 2F 1 A, B C Let s look at a few examples. First let s see how this generalizes the Meixner polynomials, which are the most general Sheffer orthogonal polynomials. To get one form of) the Meixner polynomials, we take B = uc and then take the limit as C, getting as the exponential generating function for the moments 1 u)e t + u ) A

We have µ n t n n! = A) n B) n e At 1 e t ) n C) n n! ) 1 e t. = e At 2F 1 A, B C As another example, if we take A = B = 1, C = 2, we get the Bernoulli numbers: so µ n = B n. µ n t n n! = t e t 1,

We have µ n t n n! = A) n B) n e At 1 e t ) n C) n n! ) 1 e t. = e At 2F 1 A, B C Similarly, if we take A = 1, B = 2, C = 3, we get the Bernoulli numbers shifted by 1: so µ n = 2B n+1. t n µ n n! = 2d t dt e t 1,

We can use the same approach on the Wilson polynomials, which are the most general classical orthogonal polynomials with q = 1). They are defined by W n x 2 ) = 4 F 3 n, n + a + c + d 1, a + ix, a ix a + b, a + c, a + d ) 1, in this form they are not monic). The corresponding linear functional is L px) ) = 1 Γa + ix)γb + ix)γc + ix)γd + ix) 2 2π Γ2ix) px 2 ) dx 0

It follows easily from known facts that L x + a 2 )x + a + 1) 2 ) x + a + n 1) 2 ) ) = a + b) na + c) n a + d) n a + b + c + d) n so from our first lemma, µ n t n a + b) n a + c) n a + d) n t n = a + b + c + d) n n j=0 1 + a + j) 2 t )

It follows easily from known facts that L x + a 2 )x + a + 1) 2 ) x + a + n 1) 2 ) ) = a + b) na + c) n a + d) n a + b + c + d) n so from our first lemma, µ n t n a + b) n a + c) n a + d) n t n = a + b + c + d) n n j=0 1 + a + j) 2 t ) What about an exponential generating function?

It follows easily from known facts that L x + a 2 )x + a + 1) 2 ) x + a + n 1) 2 ) ) = a + b) na + c) n a + d) n a + b + c + d) n so from our first lemma, µ n t n a + b) n a + c) n a + d) n t n = a + b + c + d) n n j=0 1 + a + j) 2 t ) What about an exponential generating function? If we replace t with t 2, then the denominator factors into linear factors: n 1 a + j) 2 t 2) = ) ) ) 1 a + n)t 1 a + 1)t 1 at j=0 1 + at ) 1 + a + 1 ) t 1 + a + n)t ).

We want to apply our lemma t m ) ε = e At 1 e t ) m. 1 + At)1 + A + 1)t) 1 + A + m)t) m! to t 2n 1 a + n)t ) 1 a + 1)t ) 1 at ) 1 + at ) 1 + a + 1 ) t 1 + a + n)t ).

We want to apply our lemma t m ) ε = e At 1 e t ) m. 1 + At)1 + A + 1)t) 1 + A + m)t) m! to t 2n 1 a + n)t ) 1 a + 1)t ) 1 at ) 1 + at ) 1 + a + 1 ) t 1 + a + n)t ). We can do this if a = 0 or if a = 1/2. If a = 1/2, we must multiply by t.) Our conclusion is

For a = 0, and for a = 1/2, t 2n µ n 2n)! = 3F 2 µ n t 2n+1 2n + 1)! = 2 sin t 2 3 F 2 b, c, d t ) b + c + d, 1 sin2 2 2 b + 1 2, c + 1 2, d + 1 2 b + c + d + 1 2, 3 2 ) t sin2 2

If we take the limit as d in the Wilson polynomials ) n, n + a + c + d 1, a + ix, a ix W n x 2 ) = 4 F 3 a + b, a + c, a + d 1, we get the continuous dual Hahn polynomials ) n, a + ix, a ix p n x 2 ) = 3 F 2 a + b, a + c 1. The generating function for the moments of the continuous dual Hahn polynomials is µ n a, b, c)t n = a + b) n a + c) n t n n j=0 1 + a + j) 2 t ) Then it is clear that the moments µ n a, b, c) are polynomials in a, b, and c, and they have nonnegative coefficients, as is clear from the corresponding continued fraction.

In fact µ n 1, 1, 1) = G 2n+4 and µ n 0, 1, 1) = G 2n+2, where the Genocchi numbers are given by x tan 1 2 x = n=2 G nx n /n!, and the polynomials µ n a, b, c) are polynomials studied by Dumont and Foata as refinements of the Genocchi numbers.

In fact µ n 1, 1, 1) = G 2n+4 and µ n 0, 1, 1) = G 2n+2, where the Genocchi numbers are given by x tan 1 2 x = n=2 G nx n /n!, and the polynomials µ n a, b, c) are polynomials studied by Dumont and Foata as refinements of the Genocchi numbers. For a = 0 we have the generating function µ n 0, b, c) t2n 2n)! = 2F 1 b, c 1 2 t sin2 2 ),

In fact µ n 1, 1, 1) = G 2n+4 and µ n 0, 1, 1) = G 2n+2, where the Genocchi numbers are given by x tan 1 2 x = n=2 G nx n /n!, and the polynomials µ n a, b, c) are polynomials studied by Dumont and Foata as refinements of the Genocchi numbers. For a = 0 we have the generating function µ n 0, b, c) t2n 2n)! = 2F 1 and it s not hard to check that indeed, 2F 1 1, 1 1 2 t ) sin2 = 2 b, c 1 2 t sin2 2 ), G n+2 x n n! = d 2 dx 2 x tan x 2 using 2F 1 1, 1 1 2 ) y 2 = 1 y 2 + y sin 1 y 1 y 2 ) 3/2.

Another application of the continuous dual Hahn polynomials We have µ n 1 2, 1 2 γ, 1 t2n 2γ) 2n)! = 2F 1 = sin 1 2 γt γ sin 1 2 t 1 2 1 γ), ) 1 2 1 + γ) t sin2 2 In the case γ = 1/3, the corresponding Hankel determinant counts alternating sign matrices Colomo and Pronko). 3 2

Hankel Determinants and Ternary Tree Numbers Let a n = ) 1 3n, 2n + 1 n so that a n is the number of trees with n vertices. Michael Somos conjectured that deta i+j ) 0 i,j n 1 is the number of cyclically symmetric transpose complement plane partitions whose Ferrers diagrams fit in an n n n box. This number is known to be n 3i + 1) 6i)! 2i)!. 4i + 1)! 4i)! i=1 Somos had similar conjectures for the Hankel determinants deta i+j ) 0 i,j n 1 and deta i+j+1)/2 ) 0 i,j n 1, relating them to alternating sign matrices invariant under vertical reflection and alternating sign matrices invariant under both vertical and horizontal reflection.

Let gx) = Then gx) satisfies ) 1 3n x n = 2n + 1 n gx) = 1 + xgx) 3. a n x n. If we compute the continued fraction for gx), we find empirically that it has a simple formula, which implies the determinant evaluation. I found a complicated) proof of this continued fraction. Then Guoce Xin found a much nicer proof, using Gauss s continued fraction.

Let gx) = Then gx) satisfies ) 1 3n x n = 2n + 1 n gx) = 1 + xgx) 3. a n x n. If we compute the continued fraction for gx), we find empirically that it has a simple formula, which implies the determinant evaluation. I found a complicated) proof of this continued fraction. Then Guoce Xin found a much nicer proof, using Gauss s continued fraction. However, the same method had already been used by Ulrich Tamm to evaluate these determinants, before Somos stated his conjectures. But there is no known combinatorial connection between these Hankel determinants and plane partitions or alternating sign matrices.)

The key fact is that the continued fraction for gx) is a special case of Gauss s continued fraction: where 2F 1 a, b + 1 c + 1 ) / x 2F 1 a, b c ) x = Sx; λ 1, λ 2,...), 1) a + n 1)c b + n 1) λ 2n 1 =, c + 2n 2)c + 2n 1) n = 1, 2,..., b + n)c a + n) λ 2n =, c + 2n 1)c + 2n) n = 1, 2,..., and Sx; λ 1, λ 2, λ 3,...) denotes the continued fraction 1 Sx; λ 1, λ 2, λ 3,...) = λ 1 x 1 1 λ 2x 1 λ 3x... 2)

In fact we have g = 2 F 1 2 3, 4 3 ; 3 2 27 4 x ) /2F 1 2 3, 1 3 ; 1 2 27 4 x ). and this isn t too hard to prove; if we set f = g 1 by Lagrange inversion one can show that the numerator is 1 + f ) 2 /1 2f ) and the denominator is 1 + f )/1 2f ). Xin and I tried to find all related cases where an instance of Gauss s continued fraction is a polynomial in f and thus the coefficients have an explicit formula).

In fact we have g = 2 F 1 2 3, 4 3 ; 3 2 27 4 x ) /2F 1 2 3, 1 3 ; 1 2 27 4 x ). and this isn t too hard to prove; if we set f = g 1 by Lagrange inversion one can show that the numerator is 1 + f ) 2 /1 2f ) and the denominator is 1 + f )/1 2f ). Xin and I tried to find all related cases where an instance of Gauss s continued fraction is a polynomial in f and thus the coefficients have an explicit formula). We found exactly 10, but we couldn t prove that there aren t any more.

Five of them are 1 + f = 2 F 1 2 3, 4 3 ; 3 2 1 + f ) 2 = 2 F 1 4 3, 5 3 ; 5 2 1 + f )1 + 1 2 f ) = 2F 1 5 3, 7 3 ; 7 2 1 + f )1 1 2 f ) = 2F 1 5 3, 7 3 ; 5 2 1 + f )1 + 2 5 f ) = 2F 1 2 3, 4 3 ; 5 2 Why do they factor? ) ) 27 4 /2F x 2 1 3, 1 3 ; 1 2 27 4 x ) ) 27 4 /2F x 4 1 3, 2 3 ; 3 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 5 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 3 2 27 4 x ) ) 27 4 /2F x 2 1 3, 1 3 ; 3 2 27 4 x

Five of them are 1 + f = 2 F 1 2 3, 4 3 ; 3 2 1 + f ) 2 = 2 F 1 4 3, 5 3 ; 5 2 1 + f )1 + 1 2 f ) = 2F 1 5 3, 7 3 ; 7 2 1 + f )1 1 2 f ) = 2F 1 5 3, 7 3 ; 5 2 1 + f )1 + 2 5 f ) = 2F 1 2 3, 4 3 ; 5 2 Why do they factor? We don t know. ) ) 27 4 /2F x 2 1 3, 1 3 ; 1 2 27 4 x ) ) 27 4 /2F x 4 1 3, 2 3 ; 3 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 5 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 3 2 27 4 x ) ) 27 4 /2F x 2 1 3, 1 3 ; 3 2 27 4 x

Five of them are 1 + f = 2 F 1 2 3, 4 3 ; 3 2 1 + f ) 2 = 2 F 1 4 3, 5 3 ; 5 2 1 + f )1 + 1 2 f ) = 2F 1 5 3, 7 3 ; 7 2 1 + f )1 1 2 f ) = 2F 1 5 3, 7 3 ; 5 2 1 + f )1 + 2 5 f ) = 2F 1 2 3, 4 3 ; 5 2 Why do they factor? We don t know. ) ) 27 4 /2F x 2 1 3, 1 3 ; 1 2 27 4 x ) ) 27 4 /2F x 4 1 3, 2 3 ; 3 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 5 2 27 4 x ) ) 27 4 /2F x 5 1 3, 4 3 ; 3 2 27 4 x ) ) 27 4 /2F x 2 1 3, 1 3 ; 3 2 27 4 x The other five are the same as these, but with different constant terms.