Efficient automation of index pairs in computational Conley index theory

Details Efficient automation of index pairs in computational Conley index theory Efficient automation of index pairs in computational Conley index theory

2010-08-23

arxiv.org/abs/1008.3918v2

Mathematics

Dynamical Systems

Scientific paper

We present new methods of automating the construction of index pairs, essential ingredients of discrete Conley index theory. These new algorithms are further steps in the direction of automating computer-assisted proofs of semi-conjugacies from a map on a manifold to a subshift of finite type. We apply these new algorithms to the standard map at different values of the perturbative parameter {\epsilon} and obtain rigorous lower bounds for its topological entropy for {\epsilon} in [.7, 2].

Affiliated with

Also associated with

No associations

Rating

Efficient automation of index pairs in computational Conley index theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient automation of index pairs in computational Conley index theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient automation of index pairs in computational Conley index theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392924