SYMMETRIC ITINERARY SETS
From MaRDI portal
Publication:4968463
Abstract: We consider a one parameter family of dynamical systems W :[0, 1] -> [0, 1] constructed from a pair of monotone increasing diffeomorphisms Wsub(i), such that Wsub(i)(inverse): [0, 1] -> [0, 1], (i = 0, 1). We characterise the set of symbolic itineraries of W using an attractor of an iterated closed relation,in the terminology of McGehee, and prove that there is a member of the family for which is symmetrical.
Recommendations
- Symmetric itinerary sets: algorithms and nonlinear examples
- Symmetric traveling salesman problems
- Symmetric spread sets
- Symmetry sets
- scientific article; zbMATH DE number 2015304
- Iterates of Maps with Symmetry
- The symmetric generalized traveling salesman polytope
- scientific article; zbMATH DE number 3988321
- Symmetric travelling salesman problem. Some new algorithmic possibilities
- scientific article; zbMATH DE number 1498640
Cites work
Cited in
(4)
This page was built for publication: SYMMETRIC ITINERARY SETS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968463)