Enumeration formulas for generalized \(q\)-Euler numbers

DOI10.1016/j.aam.2012.07.001zbMath1253.05034arXiv1104.4584OpenAlexW2050289785MaRDI QIDQ1761476

Jang Soo Kim

Publication date: 15 November 2012

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.4584

zbMATH Keywords

continued fractionsEuler numbersTouchard-Riordan's formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) (q)-calculus and related topics (05A30)

Related Items (1)

Moments of Askey-Wilson polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics of the three-parameter PASEP partition function
• The \(q\)-tangent and \(q\)-secant numbers via continued fractions
• A \(q\)-enumeration of alternating permutations
• Combinatorics of generalized \(q\)-Euler numbers
• Variations on descents and inversions in permutations
• Combinatorial aspects of continued fractions
• A different \(q\)-analogue of Euler numbers.
• On Touchard's continued fraction and extensions: combinatorics-free, self-contained proofs
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
• Overpartitions
• The $q$-tangent and $q$-secant numbers via basic Eulerian polynomials
• Sur Un Problème De Configurations Et Sur Les Fractions Continues

This page was built for publication: Enumeration formulas for generalized \(q\)-Euler numbers