pith. sign in

arxiv: 1805.01439 · v2 · pith:KFHWIJQGnew · submitted 2018-05-03 · 🧮 math.CO

Structural submodularity and tangles in abstract separation systems

classification 🧮 math.CO
keywords abstractorderseparationsstructuralfunctionseparationsomesubmodular
0
0 comments X
read the original abstract

We prove a tangle-tree theorem and a tangle duality theorem for abstract separation systems $\vec S$ that are submodular in the structural sense that, for every pair of oriented separations, $\vec S$ contains either their meet or their join defined in some universe $\vec U$ of separations containing $\vec S$. This holds, and is widely used, if $\vec U$ comes with a submodular order function and $\vec S$ consists of all its separations up to some fixed order. Our result is that for the proofs of these two theorems, which are central to abstract tangle theory, it suffices to assume the above structural consequence for $\vec S$, and no order function is needed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal trees of tangles: refining the essential parts

    math.CO 2023-04 unverdicted novelty 7.0

    A single theorem showing that any efficient k-tangle-distinguishing tree-decomposition of a graph can be refined so each part is either too small for a k-tangle or minimal while containing one.