Addressing the General Problem of Studying Linear Stability and Bifurcations of Periodic Orbits

Written by graphtheory | Published 2024/06/23
Tech Story Tags: hamiltonian-systems | linear-stability | krein-moser-theorem | symmetric-orbits | combinatorics | periodic-orbits | git-sequence | b-signature

TLDRResearchers study linear stability and bifurcations in Hamiltonian systems, using topological/combinatorial methods to refine the Krein–Moser theorem.via the TL;DR App

Authors:

(1) Agustin Moreno;

(2) Francesco Ruscelli.

Table of Links

Abstract

We address the general problem of studying linear stability and bifurcations of periodic orbits for Hamiltonian systems of arbitrary degrees of freedom. We study the topology of the GIT sequence introduced by the first author and Urs frauenfelder in [FM], in arbitrary dimension. In particular, we note that the combinatorics encoding the linear stability of periodic orbits is governed by a quotient of the associahedron. Our approach gives a topological/combinatorial proof of the classical Krein–Moser theorem, and refines it for the case of symmetric orbits.

This paper is available on arxiv under CC BY-NC-SA 4.0 DEED license.


Written by graphtheory | Unearthing the internet's best research and examples of graph theory in real world applications.
Published by HackerNoon on 2024/06/23