Related papers: Tangle-tree duality in abstract separation systems
In this paper we introduce the horizon visibility graph, a simple extension to the popular horizontal visibility graph representation of a time series, and show that it possesses a rigorous mathematical foundation in computational algebraic…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…
A global analysis of duality transformations is presented. It is shown that duality between quantum field theories exists only when the geometrical structure of the quantum configuration spaces of the theories comply with certain precise…
A double-arborescence is a treelike comparability graph with an all-adjacent vertex. In this paper, we first give a forbidden induced subgraph characterization of double-arborescences, where we prove that double-arborescences are precisely…
We propose to compose dynamic tree structures that place the objects in an image into a visual context, helping visual reasoning tasks such as scene graph generation and visual Q&A. Our visual context tree model, dubbed VCTree, has two key…
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to capture, in the context of solving the half-integral linkage…
This paper systematically develops the concept of entanglement threads that characterize the entanglement structure of holographic duality. Behind this framework lies a simple philosophy: holographic quantum entanglement can be visualized…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
In this work, we propose trait-based merge trees a generalization of merge trees to feature level sets, targeting the analysis of tensor field or general multi-variate data. For this, we employ the notion of traits defined in attribute…
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…
This thesis deals with Double Field Theory (DFT), an effective field theory capturing the low energy dynamics of closed strings on a torus. It renders T-duality on a torus manifest by adding $D$ winding coordinates in addition to the $D$…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
The history of the geometry of Double Field Theory is the history of string theorists' effort to tame higher geometric structures. In this spirit, the first part of this paper will contain a brief overview on the literature of geometry of…
We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…
A linear section of a double vector bundle is a parallel pair of sections which form a vector bundle morphism; examples include the complete lifts of vector fields to tangent bundles and the horizontal lifts arising from a connection in a…
Graph decompositions are the natural generalisation of tree decompositions where the decomposition tree is replaced by a genuine graph. Recently they found theoretical applications in the theory of sparsity, topological graph theory,…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…