**Description**


I my work, I met fixed-point functional equations of a very specific form. Since I am not expert in the domain of functional equations, I have not pushed the study of these very far. Here is a description of the objects.


Let $X := \lbrace x\_1, \dots, x\_k \rbrace$ be an alphabet of mutually commuting indeterminates and $F(x\_1, \dots, x\_k)$ be the formal power series
\begin{equation}
 F(x\_1, \dots, x\_k) := 
 \sum\_{\alpha\_1, \dots, \alpha\_k} 
 \lambda\_{\alpha\_1 \dots \alpha\_k} \: 
 x\_1^{\alpha\_1} \dots x\_k^{\alpha\_k},
\end{equation}
where all coefficients $\lambda\_{\alpha\_1 \dots \alpha\_k}$ are nonnegative integers.


The series $F(x\_1, \dots, x\_k)$ is defined by the fixed-point functional equation
\begin{equation}
 F(x\_1, \dots, x\_k) = x\_1 + F(P\_1(x\_1, \dots, x\_k), \dots, P\_k(x\_1, \dots, x\_k)),
\end{equation}
where for any $i \in [k]$, $P\_i(x\_1, \dots, x\_k)$ is a polynomial with nonnegative integer coefficients. Of course, there are some necessarily conditions to ensure that $F(x\_1, \dots, x\_k)$ is well-defined.


Here are two celebrated examples of fixed-point equations of this kind.


1. The series $S(x)$ defined by
\begin{equation}
 S(x) = x + S(x^2 + x^3).
\end{equation}
This functional equation has been studied by A. M. Odlyzko (see [Odl82]). One can compute first coefficients of $S(x)$ by *iteration*:
\begin{equation}
 S\_1(x) = x,
\end{equation}
\begin{equation}
 S\_2(x) = x + x^2 + x^3,
\end{equation}
\begin{equation}
 S\_3(x) = x + x^2 + x^3 + x^4 + 2x^5 + 3x^7 + 3x^8 + x^9,
\end{equation}
and so on. This generating series is of the form
\begin{equation}
 S(x) = x + x^2 + x^3 + x^4 + 2x^5 + 2x^6 + 3x^7 + 4x^8 + 5x^9 + 
 8x^{10} + 14x^{11} + 23x^{12} + \cdots
\end{equation}
and its coefficients have a combinatorial interpretation: the coefficient of $x^n$ is the number of *$2,3$-balanced trees* (see [Odl82] and also [A014535](http://oeis.org/A014535)) with $n$ leaves.
2. The series $B(x, y)$ defined by
\begin{equation}
 B(x, y) = x + B(x^2 + 2xy, x).
\end{equation}
By iteration, one finds
\begin{equation}
 B\_1(x, y) = x,
\end{equation}
\begin{equation}
 B\_2(x, y) = x + 2xy + x^2,
\end{equation}
\begin{equation}
 B\_3(x, y) = x + 2xy + x^2 + 4x^2y + 2x^3 + 4x^2y^2 + 4x^3y + x^4.
\end{equation}
The coefficient of $x^n$ in the specialization $B(x) := B(x, 0)$ is the number of *balanced binary trees* (see [BLL94] and also [A006265](http://oeis.org/A006265)) with $n$ leaves.


In my work, I encountered fixed-point functional equations rather more complicated:
\begin{equation}
 F(x, y, z) = x + F(x^2 + xy + yz, x, xy),
\end{equation}
\begin{equation}
 G(x, y, z) = x + G(x^2 + 2xy + yz, x, x^2 + xy),
\end{equation}
\begin{equation}
 H(x, y, z, t) = x + H(x^2 + 2yt + yz, x, x^2 + xy, yt + yz).
\end{equation}
Coefficients of these count some tree-like structures.


It seems that the theory is fairly well-known when the generating series are univariate (for instance, A. M. Odlyzko [Odl82] gives asymptotic formulas and recurrence relations for the coefficients of $S(x)$). In the multivariate case, it seems that only few things are known and up to my knowledge, there are no other way to express the series $B(x)$ counting balanced binary trees.


**Questions**



> 
> (1) Have you encountered other fixed-point functional equations of the described form?
> 
> 
> 


Given a fixed-point functional equation for a series $F$ of the given form:



> 
> (2) What about an other method to **extract coefficients** of $F$ otherwise than iteration?
> 
> 
> (3) What about **recurrence relations** between the coefficients of $F$?
> 
> 
> (4) What about **asymptotic approximations** for the coefficients of $F$?
> 
> 
> (5) What about **rationality**, **algebraicness**, **d-finiteness**, or other of $F$?
> 
> 
> 


**References**


[Odl82] A. M. Odlyzko. Periodic Oscillations of Coefficients of Power Series That Satisfy Functional Equations. *Advances in Mathematics*, 44:180–205, 1982


[BLL94] F. Bergeron, G. Labelle, and P. Leroux. *Combinatorial Species and Tree-like Structures*. Cambridge University Press, 1994.



Series defined by a fixed-point functional equation
You can get recurrence relations for the coefficients by considering, for each monomial, which lower degree monomials will contribute to its coefficient. 


For example, suppose we want to find the coefficients of $S$ without iteration. Iteration here is particularly bad: the degree of $S\_{k+1}$ will be $3^k$, so it will contain monomials of degree $3^{k-1}+1$ which did not appear in $S\_k$. In the limit, these will contribute to monomials of degree at least $2(3^{k-1}+1)$, so only about two thirds of the coefficients in $S\_{k+1}$ will be accurate. 


Instead, consider which smaller terms will contribute to the coefficient of $x^n$. For any $m < n$, $x^m$ will contribute if $x^n$ appears in 


$$
(x^2 + x^3)^m = \sum\_{i=0}^m \binom{m}{i}x^{3i}x^{2m-2i}
$$


Thus, we want $n=2m+i$ for some $0 \leq i \leq m$. Write $j=m-i$, and $c\_k$ for the coefficient of $x^k$ in $S$. Then to find $c\_n$, we will sum $c\_m \binom{m}{i}$ over all pairs of non-negative integers $(i,j)$ such that $2i+3j=n$ and $i+j=m$, i.e.


$$
c\_n = \sum\_{2i+3j=n}\binom{i+j}{i}c\_{i+j}
$$


So to get $c\_n$, we only need the coefficients with indices in the range $[n/3, n/2]$.


Here is a bit of sage code which calculates the coefficients up to $k$, then tells us the last one. It finds the first thousand terms listed at OEIS A014535 in about 20 seconds for me.



```
k=1000;                #number of coefficients you want
S=[0,1];               #list of coefficients, initialized with the first two values 

for n in range (2, k+1):
    count=0;                  #keeps track of the partial sums of the coefficient
    for i in range (0,n/2+1):
        for j in range((n-2*i)/3,n/3+1):
            if (2*i +3*j)==n:
                count=count+binomial(i+j,i)*S[i+j]
    S.append(count)

S[k] 
```

Applying this to the problems with more variables, we find the coefficient $b\_{m,n}$ of $x^my^n$ in $B$ is given by
$$
b\_{m,n} = 2^n \sum\_{2i+j = n+m}\binom{i}{n}b\_{i,j}
$$
In particular, this tells us something we already know from finding $B$ by iteration: the coefficient is always $0$ when $n>m$, since in that case, $2i \leq 2i+j < 2n$, so all of the binomial coefficients in the sum are $0$. This lets us take a little shortcut in the code and skip all of those terms. 



```

import numpy

k=500;
B=numpy.zeros((k+1,k+1), dtype=object);    #an array to hold the coefficients, with object type to give arbitrary precision integers
B[1,0]=1;                                  #initial values from the polynomial
B[1,1]=2;

for m in range(2,k+1):
    for n in range(0,m+1):
        count=0;
        for i in range (0, (m+n)/2 + 1):
            for j in range (0, i+1):
                if 2*i+j==m+n:
                    count=count+(2^n)*(binomial(i, n))*B[i,j]
        B[m,n]=count;

B[k,0]

```

This gives us the last term listed in the OEIS A006265 (as well as all of the previous terms, and all of the coefficients with multiples of $y$), though it takes quite a bit longer (for me, less than 15 minutes but more than 3).


Finally, I wrote up some code for your function $F$, and checked it against your paper. The coefficients $f\_{k,m,n}$ of $x^ky^mz^n$ are given by 


$$
f\_{k,m,n} = \sum\_{(a,b,c)}\binom{a}{n}\binom{a-n}{m-c-n}f\_{a,b,c};
$$
where the sum is over all non-negative integers with $2a+b+2c=k+m+n$, so each one is determined by coefficients with strictly smaller total degree (since the monomials $y^m$ never show up). I split the multinomial into two binomials to make some of the restrictions more obvious: for example, if the degree of $z$ is more than the degree of $y$, then the coefficient is 0, because the second binomial always vanishes. This is clear from the given polynomials: the only monomial with a $z$ also contains $y$.



```

j=60;
F=numpy.zeros((j,j,j), dtype=object); 
F[1,0,0]=1;
F[2,0,0]=1;
F[1,1,0]=1;
F[0,1,1]=1;

for t in range(3,j):                #t is the total degree of the monomial
    for k in range (0, t+1):        #k is the degree of x
        for m in range (0, t+1-k):  #m is the degree of y
            n=t-k-m;                #n is the degree of z
            if m >=n:
                count=0;
                for c in range(0, m-n+1):
                    for a in range (max(n,m-n-c), t/2+1):    #there was a typo here
                        b=t-2*a - 2*c;
                        if b >=0:
                            count=count+binomial(a,n)*binomial(a-n,m-c-n)*F[a,b,c];
                F[k,m,n]=count;

```

[Edited to fix the above code.]


A few other remarks: 
You will be able to find recurrence relations depending on coefficients of lower total degree for your other functions, as well as any where all polynomials have minimal degree $2$, or, those where if $P\_i$ has a term of degree $1$, then $x\_i^n$ never appears. This might tell you what you need to know about d-finiteness, though I don't know all the intricacies in that topic.


Mill, Pippenger, Rosenberg and Snyder [SICOMP, 1979] gave the recurrence relation for $S$ above, arguing combinatorially, and gave asymptotics for it in a manner similar to the central limit theorem, by estimating the binomial coefficients. Such an argument may also give you asymptotics in the other cases, though you may need to pass to higher dimensional central limit arguments to deal with the multinomials.


[Edit] 


The generic coefficients in the recursive formula only depend on the polynomials $P\_i$. I'll explain when each one is homogeneous of degree $d\_i$. The inhomogeneous case is not nearly as clean, so I'd introduce a new variable with substitution polynomial $1$ to reduce it to this case.
To find the coefficient of $f\_{n\_1,\ldots,n\_k}$, write $T=\sum\_i n\_i$ for the total degree. Then in the recursive formula, the smaller coefficient $f\_{m\_1,\ldots,m\_k}$ can only appear when $T = \sum d\_im\_i$. To find its multinomial and constant parts, write equations for each subscript in terms of the polynomials $P\_i$. If $P\_i$ has $j\_i$ many terms, you will need $j\_i$ indices, say $\tau\_{i,1}, \ldots, \tau\_{i,j\_i}$ which sum to $m\_i$. These correspond to expanding $P\_i^{m\_i}$ via the multinomial theorem, which will give you $\binom{m\_i}{\tau\_{i,1}, \ldots, \tau\_{i,j\_i}}$ multiplied by terms $c\_{i,\alpha\_1, \ldots, \alpha\_k}^{\tau\_{i,h}}$, where the $c\_i$s are the coefficients of and the $\alpha\_1, \ldots, \alpha\_k$ are the exponents of term $h$ in $P\_i$. Yikes!


So now we know what the coefficients in the recursive formula should look like, but we need to sum only over the indices $\tau$ which send us to $f\_{n\_1,\ldots,n\_k}$. Each variable gives us one equation, like $n\_1 = \sum\_{i,h} \tau\_{i, h}\alpha\_{1,h}$ where the $\alpha$ terms are the exponents again, and $h$ runs from $1$ to $j\_i$ for each $i$. These, along with the defining equations $\sum\_h\tau\_{i,h}=m\_i$ and $T = \sum d\_im\_i$ give us $2k+1$ linear equations ($1$ for each $n$, one for each $m$, and one for the total degree) with $k+1$ dependencies, so you can reduce it to just $k$ equations, and the sum is taken over all non-negative integer solutions to those.


So, for example, the coefficients of your function $G$ are 


$$
g\_{n\_1,n\_2,n\_3} = \sum \binom{m\_1}{\tau\_{1,1}, \tau\_{1,2}, \tau\_{1,3}}\binom{m\_3}{\tau\_{3,1}, \tau\_{3,2}}2^{\tau\_{1,2}}g\_{m\_1,m\_2,m\_3}
$$


Where the sum runs over all non-negative $\tau, m$ such that:


$$
2m\_1 + m\_2 + 2m\_3 = n\_1 + n\_2 + n\_3 
$$
$$
m\_1 = \tau\_{1,1} + \tau\_{1,2} + \tau\_{1,3}
$$
$$
m\_2 = \tau\_{2,2}
$$
$$
m\_3 = \tau\_{3,1} + \tau\_{3,2}
$$
$$
2\tau\_{1,1} + \tau\_{1,2} + \tau\_{2,1} + 2\tau\_{3,1} + \tau\_{3,2} = n\_1
$$
$$
\tau\_{1,2} + \tau\_{1,3} + \tau\_{3,2} = n\_2 \\
$$
$$
\tau\_{1,3} = n\_3
$$
Sorry I couldn't get the align environment to work, but you get the picture.
You can reduce it to just three equations, one of which is constant, which looks a lot nicer, but that's the generic way to do it.


