Profinite tree sets
Combinatorics
2025-05-16 v1
Abstract
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they relate to the finite tree sets they induce, and obtain a characterization of infinite tree sets in combinatorial terms.
Cite
@article{arxiv.1909.12615,
title = {Profinite tree sets},
author = {Jay Lilian Kneip},
journal= {arXiv preprint arXiv:1909.12615},
year = {2025}
}