Related papers: On Han's Hook Length Formulas for Trees
We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…
The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal.
Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux;…
Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…
We compute the decomposition of representations of Yangians into g-modules for simply-laced Lie algebras g. The decomposition has an interesting combinatorial tree structure. Results depend on a conjecture of Kirillov and Reshetikhin.
Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…
In this paper, we present an involution on some kind of colored $k$-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers $C_{k,\gamma}(n)=\frac{\gamma}{k n+\gamma}{k n+\gamma\choose…
It was proposed in hep-th/0403047 that all tree amplitudes in pure Yang-Mills theory can be constructed from known MHV amplitudes. We apply this approach for calculating tree amplitudes of gauge fields and fermions and find agreement with…
We compute the total number of spanning trees for the generalized cone of the complete graph $K_n$ and a number of families of some modified bipartite graphs $K_{m,n}$. In particular, we obtain a new method of finding the number of spanning…
A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…
We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…
We extend some results of Itai Benjamini and Yuri Lima (see \href{http://arxiv.org/pdf/1305.2610.pdf}{\cite{Benjamini}}). In this paper they consider a binary tree $\mathbb T_n$ of height $n$, each leaf is either infected by one of $k$…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…
We present a new formula for all single trace tree amplitudes in four dimensional super Yang-Mills coupled to Einstein supergravity. Like the Cachazo-He-Yuan formula, our expression is supported on solutions of the scattering equations, but…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
Let $B\subset A$ be a left or right bounded extension of finite dimensional algebras. We use the Jacobi-Zariski long nearly exact sequence to show that $B$ satisfies Han's conjecture if and only if $A$ does, regardless if the extension…
The sequence A120986 in the Encyclopedia of Integer Sequences counts ternary trees according to the number of nodes and the number of middle edges. Using a certain substition, the underlying cubic equation can be factored. This leads to an…