Toward Computational Morse–Floer Homology: Forcing Results for Connecting Orbits by Computing Relative Indices of Critical Points

Jan Bouwe van den Berg, Marcio Gameiro, Jean Philippe Lessard*, Rob Van der Vorst

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

To make progress toward better computability of Morse–Floer homology and thus enhance the applicability of Floer theory, it is essential to have tools to determine the relative index of equilibria. Since even the existence of nontrivial stationary points is often difficult to accomplish, extracting their index information is usually out of reach. In this paper, we establish a computer-assisted proof approach to determining relative indices of stationary states. We introduce the general framework and then focus on three example problems described by partial differential equations to show how these ideas work in practice. Based on a rigorous implementation, with accompanying code made available, we determine the relative indices of many stationary points. Moreover, we show how forcing results can be then used to prove theorems about connecting orbits and traveling waves in partial differential equations.

Original languageEnglish
Pages (from-to)1739-1776
Number of pages38
JournalFoundations of Computational Mathematics
Volume24
Issue number5
Early online date17 Oct 2023
DOIs
Publication statusPublished - Oct 2024

Bibliographical note

Publisher Copyright:
© SFoCM 2023.

Keywords

  • 35K57
  • 35R25
  • 57R58
  • 65G40
  • 65M30
  • Computer-assisted proofs
  • Connecting orbits
  • Floer homology
  • Forcing theorems
  • Ill-posed PDEs
  • Relative indices
  • Strongly indefinite problems equilibrium solutions

Fingerprint

Dive into the research topics of 'Toward Computational Morse–Floer Homology: Forcing Results for Connecting Orbits by Computing Relative Indices of Critical Points'. Together they form a unique fingerprint.

Cite this