2000 character limit reached
Birkhoff normal form via decorated trees (2505.04547v1)
Published 7 May 2025 in math.AP, math.DS, and math.RA
Abstract: We derive an explicit tree based ansatz for the Birkhoff normal form up to any order in the context of Hamiltonian PDEs. To do so we make use of a tree based representation of iterated Poisson brackets to encode the nested Taylor expansions along flows of a sequence of symplectic transformations. As an example we consider the cubic Schr\"odinger equation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.