JOURNAL OF
ALGEBRAIC
COMBINATORICS

Home > Vol 15, No 1 (2002)

Kristen A. Lampe

Given a power series, the coefficients of the formal inverse may be expressed as polynomials in the coefficients of the original series. Further, these polynomials may be parameterized by certain ordered, labeled forests. There is a known formula for the formal inverse, which indirectly counts these classes of forests, developed in a non-direct manner. Here, we provide a constructive proof for this counting formula that explains why it gives the correct count. Specifically, we develop algorithms for building the forests, enabling us to count them in a direct manner.

1. H. Bass, E. Connell, and D. Wright, “The Jacobian conjecture: reduction of degree and formal expansion of the inverse,” Bulletin of the American Mathematical Society 7(2) (1982), 287-330.
2. C. Ching-An Cheng, J. McKay, J. Towber, S. Sui-Sheng Wang, and D. Wright, “Reversion of power series and the extended Raney coefficients,” Transactions of the American Mathematical Society 349 (1997), 1769-1782.
3. P. Hoel, S. Port, and C. Stone, Introduction to Probability Theory, Houghton Mifflin Company, Boston, 1971.
4. K. Lampe, Relating a Counting Algorithm to the Jacobian Conjecture, in preparation.
5. G. Raney, “Functional composition patterns and power series reversion,” Transactions of the American Mathematical Society 94 (1960), 441-451.
6. D. Wright, “The tree formulas for reversion of power series,” Journal of Pure and Applied Algebra 57 (1989), 191-211.
7. D. Wright, “Formal inverse expansion and the Jacobian conjecture,” Journal of Pure and Applied Algebra 48 (1987), 199-219.
8. H. Wilf, Combinatorial Algorithms: An Update, Society for Industrial and Applied Mathematics, Philadelphia, 1989.