Related papers: Obtaining trees of tangles from tangle-tree dualit…
An algebraic proof of the Gluing Theorem at tree level of perturbation theory in String Field Theory is given. Some applications of the theorem to closed string non-polynomial action are briefly discussed
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
We establish duality for monogamy of entanglement: whereas monogamy of entanglement inequalities provide an upper bound for bipartite sharability of entanglement in a multipartite system, we prove that the same quantity provides a…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…
In previous work we derived the topological terms in the M-theory action in terms of certain characters that we defined. In this paper, we propose the extention of these characters to include the dual fields. The unified treatment of the…
We show that Bloch's complex of relative zero-cycles can be used as a dualizing complex over perfect fields and number rings. This leads to duality theorems for torsion sheaves on arbitrary separated schemes of finite type over…
In this paper, we discuss the entanglement properties of graph-diagonal states, with particular emphasis on calculating the threshold for the transition between the presence and absence of entanglement (i.e. the separability point). Special…
While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…
This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
In this survey, we explain a version of topological $L^2$-Serre duality for singular complex spaces with arbitrary singularities. This duality can be used to deduce various $L^2$-vanishing theorems for the $\overline\partial$-equation on…
It is well-known that the number of spanning trees, denoted by $\tau(G)$, in a connected multi-graph $G$ can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method…
We show the Graceful Tree Conjecture holds.
We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.