Symplectic capacity and short periodic billiard trajectory
Abstract
We prove that a bounded domain in n with smooth boundary has a periodic billiard trajectory with at most n+1 bounce times and of length less than Cn r(), where Cn is a positive constant which depends only on n, and r() is the supremum of radius of balls in . This result improves the result by C.Viterbo, which asserts that has a periodic billiard trajectory of length less than C'n ()1/n. To prove this result, we study symplectic capacity of Liouville domains, which is defined via symplectic homology.
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.