Automorphism groups of countably categorical linear orders are extremely amenable
By F. G. Dorais, S. Gubkin, D. McDonald and M. Rivera
Order 30 (2013), no. 2, 415–426
- mr: 3063195
- zbl: 1279.06002
- arxiv: 1202.4092
- doi: 10.1007/s11083-012-9252-6
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.