Automorphisms of the Rado meet-tree
Logic
2025-10-01 v1 Group Theory
Abstract
We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}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\"{\i}ss\'{e} limit of finite graphs which are also meet-trees) is simple.
Cite
@article{arxiv.2310.07614,
title = {Automorphisms of the Rado meet-tree},
author = {Itay Kaplan and Binyamin Riahi and Arturo Rodriguez Fanlo},
journal= {arXiv preprint arXiv:2310.07614},
year = {2025}
}