A Note on Generic Tangle Algorithms
Combinatorics
2025-05-16 v1 Data Structures and Algorithms
Abstract
In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which outputs a certificate for the non-existence of tangles if possible, and otherwise a way to jump-start the naive tree search; and a way to obtain a tree-of-tangles.
Cite
@article{arxiv.2005.14648,
title = {A Note on Generic Tangle Algorithms},
author = {Christian Elbracht and Jay Lilian Kneip and Maximilian Teegen},
journal= {arXiv preprint arXiv:2005.14648},
year = {2025}
}
Comments
Early draft; 11 pages