2000 character limit reached
Hankel Determinants of convoluted Catalan numbers and nonintersecting lattice paths: A bijective proof of Cigler's Conjecture
Published 29 Feb 2024 in math.CO | (2402.19127v2)
Abstract: In recent preprints, Cigler considered certain Hankel determinants of convoluted Catalan numbers and conjectured identities for these determinants. In this note, we shall give a bijective proof of Cigler's Conjecture by interpreting determinants as generating functions of nonintersecting lattice paths: this proof employs the reflection principle, the Lindstr\"om-Gessel-Viennot-method and a certain construction involving reflections and overlays of nonintersecting lattice paths. Shortly after this bijective proof was presented here, Cigler provided a shorter proof based on earlier results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.