An iterated graph construction and periodic orbits of Hamiltonian delay equations

Abstract

According to the Arnold conjectures and Floer's proofs, there are non-trivial lower bounds for the number of periodic solutions of Hamiltonian differential equations on a closed symplectic manifold whose symplectic form vanishes on spheres. We use an iterated graph construction and Lagrangian Floer homology to show that these lower bounds also hold for certain Hamiltonian delay equations.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…