Rooted tree graphs and the Butcher group: combinatorics of elementary perturbation theory

From MaRDI portal
Publication:3296398

DOI10.1007/978-981-15-0298-9_6zbMATH Open1446.82035arXiv2101.09364OpenAlexW2980695522MaRDI QIDQ3296398FDOQ3296398


Authors: William G. Faris Edit this on Wikidata


Publication date: 7 July 2020

Published in: Sojourns in Probability Theory and Statistical Physics - II (Search for Journal in Brave)

Abstract: The perturbation expansion of the solution of a fixed point equation or of an ordinary differential equation may be expressed as a power series in the perturbation parameter. The terms in this series are indexed by rooted trees and depend on a parameter in the equation in a way determined by the structure of the tree. Power series of this form may be considered more generally; there are two interesting and useful group structures on these series, corresponding to operations of composition and substitution. The composition operation defines the Butcher group, an infinite dimensional group that was first introduced in the context of numerical analysis. This survey discusses various ways of realizing these rooted trees: as labeled rooted trees, or increasing labeled rooted trees, or unlabeled rooted trees. It is argued that the simplest framework is to use labeled rooted trees.


Full work available at URL: https://arxiv.org/abs/2101.09364




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Rooted tree graphs and the Butcher group: combinatorics of elementary perturbation theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296398)