arXiv:1302.1986 [math.CO]AbstractReferencesReviewsResources
Method for solving an iterative functional equation $A^{2^n}(x)=F(x)$
Dmitry Kruchinin, Vladimir Kruchinin
Published 2013-02-08, updated 2013-02-11Version 2
Using the notion of the composita, we obtain a method of solving iterative functional equations of the form $A^{2^n}(x)=F(x)$, where $F(x)=\sum_{n>0} f(n)x^n$, $f(1)\neq 0$. We prove that if $F(x)=\sum_{n>0} f(n)x^n$ has integer coefficients, then the generating function $A(x)=\sum_{n>0}a(n)x^n$, which is obtained from the iterative functional equation $4A(A(x))=F(4x)$, has integer coefficients. Key words: iterative functional equation, composition of generating functions, composita.
Comments: 11 pages
Subjects: 39B12
Related articles: Most relevant | Search more
arXiv:math/0603285 [math.CO] (Published 2006-03-13)
Enumeration of 3-letter patterns in compositions
Hook-lengths and Pairs of Compositions
The Number of Convex Polyominoes and the Generating Function of Jacobi Polynomials