| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4640242 | Journal of Computational and Applied Mathematics | 2011 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Qing-Hu Hou, Toufik Mansour,