Primitive Geometric Markov Partitions for pseudo-Anosov Homeomorphisms
Inti Cruz Diaz

TL;DR
This paper presents an effective algorithm for constructing primitive Markov partitions for pseudo-Anosov homeomorphisms on surfaces, providing a finite classification of their geometric types and a canonical form for conjugacy classes.
Contribution
It introduces a combinatorial criterion and an explicit algorithm to produce primitive Markov partitions, establishing their finiteness and canonical nature for conjugacy classification.
Findings
An explicit algorithm for constructing Markov partitions.
Existence of a finite set of primitive geometric types for each map.
Canonical Markov partitions characterize conjugacy classes.
Abstract
Let be a pseudo-Anosov homeomorphism on a closed, oriented surface. We give an effective construction of Markov partitions for based on a simple combinatorial criterion deciding when an immersed graph bounds a Markov partition. This yields an explicit algorithm: from a point at the intersection of stable and unstable separatrices of a singularity of , and a sufficiently large integer , it produces a partition . Applying the algorithm to the first intersection points of we produces the set of primitive Markov partitions. We prove the existence of an integer , the compatibility order of , depending only on the conjugacy class of , such that exists for all and all first intersection points . Each geometric Markov partition has an associated geometric type , extending…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Topological and Geometric Data Analysis · Cellular Automata and Applications
