Papers
Topics
Authors
Recent
Search
2000 character limit reached

Birkhoff normal form via decorated trees

Published 7 May 2025 in math.AP, math.DS, and math.RA | (2505.04547v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.