A proof of Cigler's quadratic recurrence for Hankel determinants of Motzkin path generating functions

For an integer k ≥ 0 let an,k(x,c) be the generating polynomial of the Motzkin paths from (0,0) to (n,k) that never go below height 0, where level steps have weight c+x at height 0 and weight c at positive height, and let Dk,n(x,c) = det(ai+j,k(x,c))0≤i,j≤n−1. We prove that for all k ≥ 0 and n ≥ 2k+2 Dk,n Dk,n−2k−2 − x2 Dk,n−1 Dk,n−2k−1 = (1−x2) Dk,n−k−12, a quadratic recurrence conjectured by J. Cigler in 2023 (MathOverflow question 456683 and eq. (18) of arXiv:2309.15557). As a by-product we obtain an expression of Dk,n as a k×k determinant built from Chebyshev polynomials reduced modulo Uk − xUk−1, together with a bilinear identity for these k×k determinants that holds for all integer shifts. We also give a proof of Cigler's companion conjecture that Dk,n(x,c) equals the determinant of an explicit matrix Hk,n(x) with entries 0, 1 and powers of x, and in particular does not depend on c; this statement has recently been proved by V. Jandhyala, and our proof was found independently. The proofs use Chebyshev polynomials, a model of Q(x)[X]/(Uk − xUk−1) by antisymmetric Laurent polynomials, a lemma on complementary minors, and a three-term Plücker relation.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24369437
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A proof of Cigler's quadratic recurrence for Hankel determinants of Motzkin path generating functions

Tianxing Yu
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

A proof of Cigler's quadratic recurrence for Hankel determinants of Motzkin path generating functions

Tianxing Yu
preprint en

Abstract

For an integer k ≥ 0 let an,k(x,c) be the generating polynomial of the Motzkin paths from (0,0) to (n,k) that never go below height 0, where level steps have weight c+x at height 0 and weight c at positive height, and let Dk,n(x,c) = det(ai+j,k(x,c))0≤i,j≤n−1. We prove that for all k ≥ 0 and n ≥ 2k+2 Dk,n Dk,n−2k−2 − x2 Dk,n−1 Dk,n−2k−1 = (1−x2) Dk,n−k−12, a quadratic recurrence conjectured by J. Cigler in 2023 (MathOverflow question 456683 and eq. (18) of arXiv:2309.15557). As a by-product we obtain an expression of Dk,n as a k×k determinant built from Chebyshev polynomials reduced modulo Uk − xUk−1, together with a bilinear identity for these k×k determinants that holds for all integer shifts. We also give a proof of Cigler's companion conjecture that Dk,n(x,c) equals the determinant of an explicit matrix Hk,n(x) with entries 0, 1 and powers of x, and in particular does not depend on c; this statement has recently been proved by V. Jandhyala, and our proof was found independently. The proofs use Chebyshev polynomials, a model of Q(x)[X]/(Uk − xUk−1) by antisymmetric Laurent polynomials, a lemma on complementary minors, and a three-term Plücker relation.

Zenodo (CERN European Organization for Nuclear Research)
Peking University (CN)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon