Constructive implicit function theorems (Q910438): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(89)90323-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968623920 / rank | |||
Normal rank |
Latest revision as of 10:16, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructive implicit function theorems |
scientific article |
Statements
Constructive implicit function theorems (English)
0 references
1989
0 references
Let \(Y=\sum^{\infty}_{n=1}a_ nX^ n \), \(a_ 1\neq 0\), be a formal power series over a commutative ring. In the first part of this paper the author presents an explicit algorithm for the coefficients \(A_ n\) of the reversed series \(X=\sum^{\infty}_{n=1}A_ nY^ n \) in terms of the \(a_ n\). He gives an explicit recurrence relation using partitions of 2n-2 with exactly n-1 parts. In the second part the author proves a constructive implicit function theorem for power series in two variables. This proof also uses direct combinatorial methods. Finally some open problems related to the previous results are listed.
0 references
formal power series
0 references
implicit function theorem
0 references
0 references
0 references