Related papers: Increasing trees and Kontsevich cycles

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…

This is preprint HAL-00429963 (2009). I describe a combinatorial construction of the cohomology classes in compactified moduli spaces of curves $\widehat{Z}_{I}\in H^{*}(\bar{\mathcal{M}}_{g,n})$ starting from the following data: an odd…

We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Fa\`a di Bruno formula,…

Complement-reducible graphs (or cographs) are the graphs formed from the single-vertex graph by the operations of complement and disjoint union. By combining the Johnson-Newman theorem on generalized cospectrality with the standard tools in…

We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…

Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…

The theory of Gauss diagrams and Gauss diagram formulas provides convenient ways to compute knot invariants, such as coefficients of the HOMFLYPT polynomial. In \cite{4,5}, the author uses Gauss diagram formulas to find combinatorial…

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…

It is well known how the linking number and framing can be extracted from the degree 1 part of the (framed) Kontsevich integral. This note gives a general formula expressing any product of powers of these two invariants as combination of…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

Using the celebrated Witten-Kontsevich theorem, we prove a recursive formula of the $n$-point functions for intersection numbers on moduli spaces of curves. It has been used to prove the Faber intersection number conjecture and motivated us…

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

The tangent number $T_{2n+1}$ is equal to the number of increasing labelled complete binary trees with $2n+1$ vertices. This combinatorial interpretation immediately proves that $T_{2n+1}$ is divisible by $2^n$. However, a stronger…

The enumeration of combinatorial classes of the complex polynomial vector fields in C presented in [Dia13] is extended here to a closed form enumeration of combinatorial classes for degree d polynomial vector fields up to rotations of…

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

We study algebraic aspects of Kontsevich integrals as generating functions for intersection theory over moduli space and review the derivation of Virasoro and KdV constraints. 1. Intersection numbers 2. The Kontsevich integral 2.1. The main…

Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…

An elimination tree for a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $x$ and recursing on the connected components of $G-x$ to produce the subtrees of $x$. Elimination trees appear in many guises…