Automorphisms of the Rado meet-tree
Abstract
We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"ss\'e limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado meet-tree (i.e. the Fra\"ss\'e limit of finite graphs which are also meet-trees) is simple.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.