Related papers: Obtaining trees of tangles from tangle-tree dualit…
We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…
Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of tangles in machine learning applications. Given a collection…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…
A continuous cohomology theory for topological quandles is introduced, and compared to the algebraic theories. Extensions of topological quandles are studied with respect to continuous 2-cocycles, and used to show the differences in second…
Scattering equations for tree-level amplitudes are viewed in the context of string theory. As a result of the comparison we are led to define a new dual model which coincides with string theory in both the small and large $\alpha'$ limit,…
This expository article delves into the Greenlees-May Duality Theorem which is widely thought of as a far-reaching generalization of the Grothendieck's Local Duality Theorem. This theorem is not addressed in the literature as it merits and…
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
Some thermodynamical properties of solids, such as heat capacity and magnetic susceptibility, have recently been shown to be linked to the amount of entanglement in a solid. However this entanglement may appear a mere mathematical artifact…
This is a general introduction to duality in field theories. The existence and breaking of global symmetries is used as a guideline to systematically prove duality between different field theories. Systems discussed include abelian and…
A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree based networks. Reticulation-visible networks and child-sibling networks are all…
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…
This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
The double point relation defines a natural theory of algebraic cobordism for bundles on varieties. We construct a simple basis (over the rationals) of the corresponding cobordism groups over Spec(C) for all dimensions of varieties and…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…