Finite difference calculus for alternating permutations
From MaRDI portal
Publication:2869921
DOI10.1080/10236198.2013.794794zbMath1284.39001arXiv1304.2483OpenAlexW2004656332MaRDI QIDQ2869921
Publication date: 7 January 2014
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.2483
secant numberstangent numbersdifference equationalternating permutationsPoupard trianglestrictly ordered binary trees
Related Items
The Entringer-Poupard matrix sequence, Tree calculus for bivariate difference equations, Secant tree calculus, Seidel triangle sequences and Bi-Entringer numbers, On the roots of the Poupard and Kreweras polynomials, The \(r\)-alternating permutations
Uses Software
Cites Work
- Unnamed Item
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
- Bijections for Entringer families
- The doubloon polynomial triangle
- The \(q\)-tangent and \(q\)-secant numbers via continued fractions
- A \(q\)-enumeration of alternating permutations
- Congruences for the q-secant numbers
- De nouvelles significations enumeratives des nombres d'Entringer
- Two other interpretations of the Entringer numbers
- DOUBLOONS AND NEW Q-TANGENT NUMBERS
- The $q$-tangent and $q$-secant numbers via basic Eulerian polynomials
- Combinatorics of geometrically distributed random variables: New \(q\)-tangent and \(q\)-secant numbers