Abstract
We generalize the kernel method to equation systems in which the number of unknowns is allowed to exceed the number of equations. With this generalization, we derive the generating functions for several kinds of sequences and generating trees whose recursions are dependent on the parity of the indices.
Original language | English |
---|---|
Pages (from-to) | 1205-1212 |
Number of pages | 8 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 235 |
Issue number | 5 |
DOIs | |
State | Published - 1 Jan 2011 |
Keywords
- Generating functions
- Generating trees
- Kernel method
- Sequences with two indices
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics