The kernel method and systems of functional equations with several conditions
From MaRDI portal
Publication:609206
DOI10.1016/j.cam.2010.08.004zbMath1227.05043OpenAlexW1998638885MaRDI QIDQ609206
Publication date: 30 November 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.004
Exact enumeration problems, generating functions (05A15) Numerical methods for functional equations (65Q20)
Related Items (3)
Nine classes of permutations enumerated by binomial transform of Fine's sequence ⋮ Impulse parameter and a new equivalence between 123- and 132-avoiding permutations ⋮ Counting water cells in bargraphs of compositions and set partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases and primary decomposition in polynomial rings in one variable over Dedekind domains
- Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels
- Generating trees and the Catalan and Schröder numbers
- Generating trees for permutations avoiding generalized patterns
- Three Hoppy path problems and ternary paths
- Kernel method and linear recurrence system
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Kernel method and system of functional equations
- Recurrence relations with two indices and even trees
- Combinatorial methods and recurrence relations with two indices
This page was built for publication: The kernel method and systems of functional equations with several conditions