Approximation of Generating Function Barcode for Hamiltonian Diffeomorphisms

Persistence modules and barcodes are used in symplectic topology to define various invariants of Hamiltonian diffeomorphisms, however numerical methods for computing these barcodes are not yet well developed. In this paper we define one such invariant called the generating function barcode of compactly supported Hamiltonian diffeomorphisms of $\mathbb{R}^{2n}$ by applying Morse theory to generating functions quadratic at infinity associated to such Hamiltonian diffeomorphisms and provide an algorithm (i.e a finite sequence of explicit calculation steps) that approximates it.