Related papers: A Dual Ramsey theorem for trees
We prove a relative Lefschetz-Verdier theorem for locally acyclic objects over a Noetherian base scheme. This is done by studying duals and traces in the symmetric monoidal $2$-category of cohomological correspondences. We show that local…
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…
We classify central extensions of the dg Lie algebra of derived global sections of the tangent sheaf on the punctured, formal 2-disk. We then prove a local and universal form of the Grothendieck--Rieman--Roch theorem for families of…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
We prove a version for random measures of the celebrated Kantorovich-Rubinstein duality theorem and we give an application to the coupling of random variables which extends and unifies known results.
A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…
Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all infinite graphs. Our result has a number of applications…
A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vertices, in which the labels increase along every chain from…
Consider jointly Gaussian random variables whose conditional independence structure is specified by a graphical model. If we observe realizations of the variables, we can compute the covariance matrix, and it is well known that the support…
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations…
We settle in the affirmative the Graham-Sloane conjecture.
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
We prove the relationship between the Hosoya polynomial and the edge-Hosoya polynomial of trees. The connection between the edge-hyper-Wiener index and the edge-Hosoya polynomial is established. With these results we also prove formulas for…
Consider tuples of separable algebras over a common local or global number field, related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best…
The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable by [Godoy, Gim\'enez, Ramos, \`Alvarez: The HOM problem is decidable. STOC (2010)]. Research on…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
We give an alternative, more geometric, proof of the well-known Joyal-Tierney Theorem in locale theory by utilizing Priestley duality for frames.
In this article, we give two proofs of Carlson's theorem for located words in~$\mathsf{ACA}^+_0$. The first proof is purely combinatorial, in the style of Towsner's proof of Hindman's theorem. The second uses topological dynamics to show…
We prove a strong form of the invariance under re-rooting of the distribution of the continuous random trees called Levy trees. This extends previous results due to several authors.
We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…