Tree calculus for bivariate difference equations
DOI10.1080/10236198.2014.933820zbMath1306.05008arXiv1304.2484OpenAlexW2114695506MaRDI QIDQ2938367
Publication date: 14 January 2015
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.2484
tangent numberspartial difference equationsbivariate distributionsend of minimal chaintree calculusstrictly ordered binary treesparent maximum leafpoupard triangle
Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Bernoulli and Euler numbers and polynomials (11B68) Exponential and trigonometric functions (33B10)
Related Items (4)
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
- De nouvelles significations enumeratives des nombres d'Entringer
- Two other interpretations of the Entringer numbers
- Finite difference calculus for alternating permutations
This page was built for publication: Tree calculus for bivariate difference equations