Profinite separation systems.

*(English)*Zbl 07204031Summary: Separation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory about infinite separation systems and how they relate to the finite separation systems they induce. They can be used to prove tangle-type duality theorems for infinite graphs and matroids, which will be done in future work that will build on this paper.

##### MSC:

06-XX | Order, lattices, ordered algebraic structures |

PDF
BibTeX
XML
Cite

\textit{R. Diestel} and \textit{J. Kneip}, Order 37, No. 1, 179--205 (2020; Zbl 07204031)

Full Text:
DOI

##### References:

[1] | Bowler, N., Diestel, R., Mazoit, F.: Tangle-tree duality in infinite graphs and matroids. In preparation |

[2] | Diestel, R., Abstract separation systems, Order, 35, 157-170 (2018) · Zbl 06857726 |

[3] | Diestel, R., Tree sets, Order, 35, 171-192 (2018) · Zbl 1412.06002 |

[4] | Diestel, R.; Hundertmark, F.; Lemanczyk, S., Profiles of separations: in graphs, matroids, and beyond, Combinatorica, 39, 1, 37-75 (2019) · Zbl 1438.05040 |

[5] | Diestel, R., Oum, S.: Tangle-tree duality in abstract separation systems. arXiv:1701.02509 (2017) |

[6] | Diestel, R., Whittle, G.: Tangles and the Mona Lisa. arXiv:1603.06652 |

[7] | Kneip, J.: Infinite tree sets and their representations. Masterarbeit UniversitĂ¤t Hamburg (2016) |

[8] | Kneip, J.: Profinite tree sets. arXiv:1909.12615 (2019) |

[9] | Ribes, L., Zalesskii, P.: Profinite Groups. Springer (2010) |

[10] | Robertson, N.; Seymour, PD, Graph minors. X. Obstructions to treedecomposition, J. Combin. Theory (Series B), 52, 153-190 (1991) · Zbl 0764.05069 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.