Hankel determinants and continued fractions
Hankel transforms of sequences and their invariance under binomial transforms, Heilermann's formula linking Jacobi continued fractions to weighted Motzkin paths, Catalan-sum Hankel determinants, and Toeplitz–Hessenberg determinants.
- Hankel determinants of Catalan sums
- Hankel transforms and Jacobi continued fractions
- Heilermann's formula
- Stieltjes production matrices
- Toeplitz–Hessenberg determinants of Fuss–Catalan numbers
TheoremLayman's theorem: the binomial transform preserves the Hankel transform#✓fully proved
For every sequence of integers \((a_n)_{n \ge 0}\), the Hankel transform of the binomial transform of \(a\) equals the Hankel transform of \(a\). Here the binomial transform of \(a\) is the sequence \(b_n = \sum_{i=0}^{n} \binom{n}{i} a_i\), and the Hankel transform of a sequence \(c\) is the sequence whose \(n\)-th term, for \(n \ge 0\), is the determinant of the \((n+1) \times (n+1)\) matrix \((c_{i+j})_{0 \le i, j \le n}\).
theorem layman_binomial_transform_hankel_invariant
(a : ℕ → ℤ) :
hankelTransform (binomialTransform a) = hankelTransform a
def hankelTransform {R : Type*} [CommRing R] (a : ℕ → R) : ℕ → R :=
fun n ↦ Matrix.det (Matrix.of fun i j : Fin (n + 1) ↦ a (i.val + j.val))
MathlibExt/NumberTheory/HankelTransform.lean:34
def binomialTransform (a : ℕ → ℤ) (n : ℕ) : ℤ :=
fallingKBinomialTransform 1 a n
MathlibExt/Combinatorics/Enumerative/FallingKBinomialTransform.lean:35
Sources
- John W. Layman, The Hankel Transform and Some of its Properties, Journal of Integer Sequences 4 (2001), Theorem 1, https://cs.uwaterloo.ca/journals/JIS/VOL4/LAYMAN/hankel.pdf. Campaign source passage: Mahid M. Mangontarum, https://cs.uwaterloo.ca/journals/JIS/VOL20/Mangontarum/mango4.tex, lines 535-557.
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.