Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Al-Salam-Carlitz polynomials Askey-Wilson polynomials

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Orthogonal polynomials and functions in several variables expressible in terms of basic hypergeometric functions in one variable (33D50) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Review text

Summary: In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where \(d=0\). Their values have already been computed by \textit{J. S. Kim} and \textit{D. Stanton} in [J. Math. Anal. Appl. 421, No. 1, 501--520 (2015; Zbl 1302.33017)], however, the proof is not completely combinatorial, which means that an explicit bijection has not been exhibited yet. In this work, we use a new combinatorial approach for the simpler case of Al-Salam-Carlitz, using a sign reversing involution that directly operates on Motzkin path. We then generalize this method to Askey-Wilson polynomials with \(d=0\) only, providing the first fully combinatorial proof for that case.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039996)