Search arXivSearch

arXiv · 1902.07833

Validated computations for connecting orbits in polynomial vector fields

Abstract

In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of local charts on the (un)stable manifolds by using the Parameterization Method and to use Chebyshev series to parameterize the orbit in between, which solves a boundary value problem. The existence of a heteroclinic orbit can then be established by setting up an appropriate fixed-point problem amenable to computer-assisted analysis. The fixed point problem simultaneously solves for the local (un)stable manifolds and the orbit which connects these. We obtain explicit rigorous control on the distance between the numerical approximation and the heteroclinic orbit. Transversality of the stable and unstable manifolds is also proven.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Bouwe van den Berg, Ray Sheombarsing. 2019-02-21. Validated computations for connecting orbits in polynomial vector fields. https://arxiv.org/abs/1902.07833

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS