Abstract
We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fraïssé limit over a finite relational language is simple. As a prototypical case, the group of automorphisms of the Rado meet-tree (i.e. the Fraïssé limit of finite graphs which are also meet-trees) is simple.
| Original language | English |
|---|---|
| Pages (from-to) | 13-60 |
| Number of pages | 48 |
| Journal | Journal of Algebra |
| Volume | 677 |
| DOIs | |
| State | Published - 1 Sep 2025 |
Bibliographical note
Publisher Copyright:© 2025 Elsevier Inc.
Keywords
- Automorphism groups
- Fraisse limits
- Homogeneous structures
- Meet-trees
- Oligomorphic permutation groups
- Semilattices
- Simple groups
- Stationary independence relations
Fingerprint
Dive into the research topics of 'Automorphisms of the Rado meet-tree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver