Tree calculus for bivariate difference equations
From MaRDI portal
Publication:2938367
Abstract: Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and then make a joint study of those two statistics. Their joint distribution is shown to be symmetric and to be expressed in the form of an explicit three-variable generating function.
Recommendations
- Secant tree calculus
- Finite difference calculus for alternating permutations
- Generalized Digital Trees and Their Difference—Differential Equations
- More patterns in trees: up and down, young and old, odd and even
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
Cites work
- Bijections for Entringer families
- De nouvelles significations enumeratives des nombres d'Entringer
- Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
- Finite difference calculus for alternating permutations
- The On-Line Encyclopedia of Integer Sequences
- Two other interpretations of the Entringer numbers
Cited in
(9)- Trees and numerical methods for ordinary differential equations
- PRESCRIBED HORIZONTAL AND VERTICAL TREES PROBLEM OF QUADRATIC DIFFERENTIALS
- Secant tree calculus
- On the roots of the Poupard and Kreweras polynomials
- Finite difference calculus for alternating permutations
- scientific article; zbMATH DE number 17051 (Why is no real title available?)
- A Differential Approach for Staged Trees
- Some polynomials with unimodular roots
- The Entringer-Poupard matrix sequence
This page was built for publication: Tree calculus for bivariate difference equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938367)