Complexity of piecewise convex transformations in two dimensions, with applications to polygonal billiards
E. Gutkin, S. Tabachnikov
Abstract
We introduce the class of piecewise convex transformations, and study their complexity. We apply the results to the complexity of polygonal billiards on surfaces of constant curvature.
Create a lesson
Related papers
Physical and emergent nonpairwise interactions in oscillator networks: from higher-order phase reduction to coupling design
Riccardo Muolo, Hiroya Nakao, Christian Bick
Degree Growth of Iterates of Curves and Likely Intersections
Sina Saleh, Jit Wu Yap
Infinite prime sumsets in structured and Uk(Φ)-uniform sets
Felipe Hernández, Tristán Radić
Long-Lived Carpet-Like Transients in Time-Dependent Modular Discrete Laplacian Dynamics
Małgorzata Nowak-Kępczyk
SIPHy: Sparse identification of port-Hamiltonian systems from noisy data
Håkon Noren Myhr, Sølve Eidnes, J. Nathan Kutz
Extended dynamic mode decomposition with Fourier dictionaries: Error bounds and fast implementation
Felix Bartel, Sandra Ritter, Manuel Schaller et al.