Patchworks
In the paper cluster systems \((X, C)\), where \(X\) is a set and \(C\) is a family of its subsets are considered. \(C\) is a hierarchy iff for every \(A, B\in C\), \(A\cap B\in\{\emptyset, A, B\}\). \(C\) is ample iff for every \(A, B\in C\) such that \(\#\{D\in C\mid A\subseteq D\subseteq B\}=2\), \(B-A\in C\). \((X, C)\) is called a patchwork iff for each non-empty \(D\subseteq C\) such that \(\bigcap D\neq\emptyset\), both \(\bigcap D\) and \(\bigcup D\) are in \(C\). The main result of the paper states that a patchwork \((X, C)\) contains a maximal hierarchy iff \(C\) is ample, \(\emptyset, X\in C\), and for each \(x\in X\), \(\{x\}\in C\). The article contains also a few other interesting results on patchworks.
- Patching and thickening problems
- A note on maximal hierarchies
- Discrete Coons patches
- Combinatorial properties of triplet covers for binary trees
- Phylogenetic flexibility via Hall-type inequalities and submodularity
- Set relations and set systems induced by some families of integral domains
- scientific article; zbMATH DE number 622432 (Why is no real title available?)
- On some categories of structured sets
- Slim sets of binary trees
- A Hall-type theorem for triplet set systems based on medians in trees
This page was built for publication: Patchworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927521)
