Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hamiltonian Braids via Generating Functions

Published 9 Oct 2024 in math.SG | (2410.06495v1)

Abstract: Given a compactly supported Hamiltonian diffeomorphism of the plane, one can define a generating function for it. In this paper, we show how generating functions retain information about the braid type of collections of fixed points of Hamiltonian diffeomorphisms. One the one hand, we show that it is possible to define a filtration keeping track of linking numbers of pairs of fixed points on the Morse complex of the generating function. On the other, we provide a finite-dimensional proof of a Theorem by Alves and Meiwes about the lower-semicontinuity of the topological entropy with respect to the Hofer norm. The technical tools come from work by Le Calvez which was developed in the 90s. In particular, we apply a version of positivity of intersections for generating functions.

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.

Authors (1)

Collections

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