Constructing non-uniquely ergodic arational trees

2013/11/07 by Brian P. Mann, Mann, Brian, Patrick Reynolds +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Dynamical Systems (math.DS) #FOS: Mathematics #Geometric Topology (math.GT) #Geometric and Algebraic Topology #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.1311.1771

openalex publication_date 2013/11/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this technical note, we adapt an idea of Gabai to construct non-uniquely ergodic, non-geometric, arational trees.

Citations

• Reducing systems for very small trees

Related

• How special is your Aronszajn tree?
• Specializing Wide Aronszajn Trees without Adding Reals
• Non-ambiguous trees: new results and generalisation
• Alternative Proof of the Determinant of Complete Non-Ambiguous Trees
• Non-ambiguous trees: new results and generalisation (Full version)