Related papers: Analysis of a Double Kruskal Theorem
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
In this review paper, we describe the use of couplings in several different mathematical problems. We consider the total variation norm, maximal coupling, and the $\bar{d}$-distance. We present a detailed proof of a result recently proved:…
A new nonparametric approach, based on a decision tree algorithm, is proposed to calculate the overlap between two probability distributions. The devised framework is described analytically and numerically. The convergence of the estimated…
Mutual learning of a pair of tree parity machines with continuous and discrete weight vectors is studied analytically. The analysis is based on a mapping procedure that maps the mutual learning in tree parity machines onto mutual learning…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
We study cocycle properties of vertex operators and present an operator representation of cocycle operators, which are attached to vertex operators to ensure the duality of amplitudes. It is shown that this analysis makes it possible to…
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 existence of a partition of the common set of the vertices of two forests into two subsets, when difference of their capacities in the neighborhood of each vertex of each forest not greater than 2 is proved, and an example, which shows…
A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal--Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. In…
We study decay of unstable D-branes in string theory in the presence of electric field, and show that the classical open string theory results for various properties of the final state agree with the properties of closed string states into…
Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split:…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
This article is a supplementary document for the CoPPar Tree paper, providing a detailed correctness proof for the CoPPar architecture.
For a partial lattice L the so-called two-point extension is defined in order to extend L to a lattice. We are motivated by the fact that the one-point extension broadly used for partial algebras does not work in this case, i.e. the…
We prove a combination theorem for PD(n)-pairs.
We find some extensions of the Kraft-Russell Generic Equivalence Theorem and using it we obtain a simple proof of a result of Dubouloz and Kishimoto.
Double field theory yields a formulation of the low-energy effective action of bosonic string theory and half-maximal supergravities that is covariant under the T-duality group O$(d,d)$ emerging on a torus $T^d$. Upon reduction to three…
We find a duality between two well-known trees, the Calkin-Wilf tree and the Stern-Brocot tree, derived from cluster algebra theory. The vertex sets of these trees are the set of rational numbers, and they have cluster structures induced by…
We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…