Solutions to a Problem in Power Series Reversion
A. J. Goldstein, Anthony Hall
Abstract
A. J. Goldstein, Anthony Hall
Abstract
This paper presents the general solution of the following problem in two forms. Let $f(x,y)$ be defined by the formal power series $f(x,y) = \sum _{m = 0}^\infty \sum _{n = 0}^\infty f_{mn} x^m y^n $ with $f_{00} \ne 0$. If v satisfies $v(x,y) = f(xv^a ,yv^b )$, where a and b are constants, then find the formal power series expansion of $v^c(x,y)$, where c is also a constant. A special case.of this problem, which occurs in a paper by R. A. Handelsman and J. S. Lew [1], has been proposed as a problem to be solved by computer using a symbolic algebra system [2].
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents the general solution of the following problem in two forms. Let $f(x,y)$ be defined by the formal power series $f(x,y) = \sum _{m = 0}^\infty \sum _{n = 0}^\infty f_{mn} x^m y^n $ with $f_{00} \ne 0$. If v satisfies $v(x,y) = f(xv^a ,yv^b )$, where a and b are constants, then find the formal power series expansion of $v^c(x,y)$, where c is also a constant. A special case.of this problem, which occurs in a paper by R. A. Handelsman and J. S. Lew [1], has been proposed as a problem to be solved by computer using a symbolic algebra system [2].
Key concepts: Formal power series, Power series, Mathematics, Series (stratigraphy), Constant (computer programming), Combinatorics, Symbolic computation, Mathematical analysis