Related papers: Analysis of a Double Kruskal Theorem
In this note I provide two extensions of a particular case of the classical Poncelet theorem.
We introduce and study semi-equational and weakly semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
This paper shows the complementary roles of mathematical and engineering points of view when dealing with truss analysis problems involving systems of linear equations and inequalities. After the compatibility condition and the mathematical…
In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.
We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…
We define and study a new compactification, called the height compactification of the horospheric product of two infinite trees. We will provide a complete description of this compactification. In particular, we show that this…
We generalize the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with probability comparable to the total-variation distance between…
I review the equivalence between duality operators on two-forms and conformal structures in four dimensions, from a Clifford algebra point of view (due to Urbantke and Harnett). I also review an application, which leads to a set of…
The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give…
Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…
In this paper we give a characterisation of trivial extension algebras in terms of quivers with relations. This result is based on a explicit description of the ideal of relations of the trivial extension of an algebra, given by the first…
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to…
We compute the tree-level $H^2R^3$ couplings of type II strings and provide some basic tests of the couplings by considering both K3 and Calabi-Yau threefold compactifications. Curiously, additional kinematical structures show up at tree…
Tree amplitudes of the production of two kinds of scalar particles at threshold from one virtual particle are calculated in a model of two scalar fields with $O(2)$ symmetric quartic interaction and unequal masses. These amplitudes exhibit…
In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
The tree theorem for pairs ($\mathsf{TT}^2_2$), first introduced by Chubb, Hirst, and McNicholl, asserts that given a finite coloring of pairs of comparable nodes in the full binary tree $2^{<\omega}$, there is a set of nodes isomorphic to…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
Vine copulas are pair-copula constructions enabling multivariate dependence modeling in terms of bivariate building blocks. One of the main tasks of fitting a vine copula is the selection of a suitable tree structure. For this the prevalent…