Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable
arXiv:1202.4092 · doi:10.1007/s11083-012-9252-6
Abstract
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes.