Witnessing and guiding sets of tangles
Combinatorics
2025-07-08 v1
Abstract
Tangles o er a way to indirectly but precisely capture cluster-like though possibly fuzzy substructures in discrete data. In this paper, we analyze witnessing and guiding sets of tangles that can help to find proper cluster candidates for given tangles. We show that every k-tangle has a witnessing set whose size is bounded in an exponential function in k which improves a result of Grohe and Schweizer. Further, we generalize a result of Diestel, Elbracht and Jacobs by providing a characterization of tangles that have a guiding function of some given reliability.
Cite
@article{arxiv.2507.04394,
title = {Witnessing and guiding sets of tangles},
author = {Annegret Seibt},
journal= {arXiv preprint arXiv:2507.04394},
year = {2025}
}
Comments
20 pages, no figures