Profinite tree sets
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915288063148032 |
|---|---|
| author | Kneip, Jay Lilian |
| author_facet | Kneip, Jay Lilian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1909_12615 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Profinite tree sets Kneip, Jay Lilian Combinatorics 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. |
| title | Profinite tree sets |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1909.12615 |