Related papers: A trinity of duality: non-separable planar maps, $…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…
There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Such…
In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…
An enumerative invariant theory in Algebraic Geometry, Differential Geometry, or Representation Theory, is the study of invariants which 'count' $\tau$-(semi)stable objects $E$ with fixed topological invariants $[E]=\alpha$ in some…
In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs $(G,H)$ such that for any digraph, $D$, $G\to D$ if and only if $D\not\to H$. The directed path on $k+1$ vertices together with the transitive tournament…
We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…
Mappings between models may be obtained by unitary transformations with preservation of the spectra but in general a change in the states. Non- canonical transformations in general also change the statistics of the operators involved. In…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
We introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…
In this thesis, we take a journey through two different but not dissimilar stories with an underlying theme of combinatorics emerging from scattering amplitudes in quantum field theories. The first part tells the tale of the…
A classical set of birational invariants of a variety are its spaces of pluricanonical forms and some of their canonically defined subspaces. Each of these vector spaces admits a typical metric structure which is also birationally…
Let $\cal A$ and $\cal B$ be Banach algebras. A linear map $T:{\cal A} \rightarrow {\cal B}$ is called separating or disjointness preserving if $ab=0$ implies $Ta\;Tb = 0$ for all $a,b\in {\cal A}$. In this paper, we study a new class of…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
The term Stone-type duality often refers to a dual equivalence between a category of lattices or other partially ordered structures on one side and a category of topological structures on the other. This paper is part of a larger endeavour…
We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the standard ones. A…
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…
We prove that two general ternary forms are simultaneously identifiable only in the classical cases of two quadratic and a cubic and a quadratic form. We translate the problem into the study of a certain linear system on a projective bundle…