Secant tree calculus
From MaRDI portal
Publication:403213
DOI10.2478/s11533-014-0429-7zbMath1297.05017arXiv1304.2485OpenAlexW2154749449MaRDI QIDQ403213
Publication date: 29 August 2014
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.2485
secant numberspartial difference equationsalternating permutationsbivariate distributionsbinary increasing labeled treesend of minimal chainEntringer distributionparent of maximum leafsecant and tangent treestree calculus
Trees (05C05) Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Bernoulli and Euler numbers and polynomials (11B68) Partial difference equations (39A14)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- De nouvelles significations enumeratives des nombres d'Entringer
- Two other interpretations of the Entringer numbers
- A continued fraction expansion for a \(q\)-tangent function
- Quadrant marked mesh patterns in alternating permutations
- A continued fraction expansion for a \(q\)-tangent function: an elementary proof
- Finite difference calculus for alternating permutations
- Tree calculus for bivariate difference equations
- A Survey of Alternating Permutations
- DOUBLOONS AND NEW Q-TANGENT NUMBERS
- Increasing trees and alternating permutations
- Combinatorics of geometrically distributed random variables: New \(q\)-tangent and \(q\)-secant numbers