Related papers: Tangle-tree duality in abstract separation systems
This is the fourth paper in the CayleyPy project, which applies AI methods to the exploration of large graphs. In this work, we suggest the existence of a new discrete version of holographic string dualities for this setup, and discuss…
Recently the duality map between electric-like asymptotic charges of $p$-form gauge theories is studied. The outcome is an existence and uniqueness theorem and the topological nature of the duality map. The goal of this work is to extend…
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…
An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, \chi)$ where $T$ is a tree and $\chi : V(T) \rightarrow 2^{V(G)}$ is a function satisfying the following two axioms:…
We give a simple proof of the "tree-width duality theorem" of Seymour and Thomas that the tree-width of a finite graph is exactly one less than the largest order of its brambles.
Treewidth is a well-studied decompositional parameter to measure the tree-likeness of a graph. While the propositional satisfiability problem (SAT) is known to be tractable when parameterized by the treewidth of the underlying primal graph,…
Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstructed through a simple first-order interpretation. A prominent…
We show that in the context of two-dimensional sigma models minimal coupling of an ordinary rigid symmetry Lie algebra $\mathfrak{g}$ leads naturally to the appearance of the "generalized tangent bundle" $\mathbb{T}M \equiv TM \oplus T^*M$…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
We provide a degree condition on a regular $n$-vertex graph $G$ which ensures the existence of a near optimal packing of any family $\mathcal H$ of bounded degree $n$-vertex $k$-chromatic separable graphs into $G$. In general, this degree…
In this paper we present a novel algorithm and efficient data structure for anomaly detection based on temporal data. Time-series data are represented by a sequence of symbolic time intervals, describing increasing and decreasing trends, in…
Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility…
Many computational problems admit fast algorithms on special inputs, however, the required properties might be quite restrictive. E.g., many graph problems can be solved much faster on interval or cographs, or on graphs of small…
We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive…
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…
Bayesian networks faithfully represent the symmetric conditional independences existing between the components of a random vector. Staged trees are an extension of Bayesian networks for categorical random vectors whose graph represents…
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small…
Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…