Related papers: Hook Length Formulas for Trees by Han's Expansion

We consider simply generated trees and study multiplicative functions on rooted plane trees. We show that the associated generating functions satisfy differential equations or difference equations. Our approach considers B-series from…

A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…

We describe the proalgebraic groups represented by three Hopf algebras on planar binary trees previously introduced by the author and Christian Brouder in relation with the renormalization of quantum electrodynamics. Using two monoidal…

In this paper we provide some exact formulas for projective dimension and the regularity of powers of edge ideals of vertex-weighted rooted forests. These formulas are functions of the weight of the vertices and the number of edges. We also…

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…

We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…

The Horton-Strahler number of a tree is a measure of its branching complexity; it is also known in the literature as the register function. We show that for critical Galton-Watson trees with finite variance conditioned to be of size $n$,…

For fixed $t\ge 2$, we consider the class of representations of $1$ as sum of unit fractions whose denominators are powers of $t$ or equivalently the class of canonical compact $t$-ary Huffman codes or equivalently rooted $t$-ary plane…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

In this work we define a novel edit distance for trees considered with some abstract weights on the edges. The metric is driven by the idea of considering trees as topological summaries in the context of persistence and topological data…

Every finite metric tree has generalized roundness strictly greater than one. On the other hand, some countable metric trees have generalized roundness precisely one. The purpose of this paper is to identify some large classes of countable…

In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…

The following theorem is proved: For all $k$-connected graphs $G$ and $H$ each with at least $n$ vertices, the treewidth of the cartesian product of $G$ and $H$ is at least $k(n -2k+2)-1$. For $n\gg k$ this lower bound is asymptotically…

We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is of exponential form $e^{-\mu h}$. Defining the total weight for such trees of fixed size to be $Z^{(\mu)}_N$,…

We calculate form factors of half-BPS operators in N=4 super Yang-Mills theory at tree level and one loop using novel applications of recursion relations and unitarity. In particular, we determine the expression of the one-loop form factors…

Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

We prove a conjecture by Guo-Niu Han which interpolates between two known hook expansion formulas.

Since the 90's, several authors have studied a probability distribution on the set of Boolean functions on $n$ variables induced by some probability distributions on formulas built upon the connectors $And$ and $Or$ and the literals…

The paper is devoted to the derivation of the expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov in their study of the Seiberg-Witten Theory. We provide a refinement…