Related papers: Hook Length Formulas for Trees by Han's Expansion
A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…
In this work, we study the concept of the length function and some of its combinatorial properties for the class of extended affine root systems of type $A_1$. We introduce a notion of root basis for these root systems, and using a unique…
A proof is given of the formula, recently proposed by Cachazo, He and Yuan (CHY) for gluon tree amplitudes in pure Yang-Mills theory in arbitrary dimension. The approach is to first establish the corresponding result for massless $\phi^3$…
For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
In this article we introduce the fractional Hardy-Littlewood maximal function on the infinite rooted $k$-ary tree and study its weighted boundedness. We also provide examples of weights for which the fractional Hardy-Littlewood maximal…
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…
Britto, Cachazo and Feng have recently derived a recursion relation for tree-level scattering amplitudes in Yang-Mills. This relation has a bilinear structure inherited from factorisation on multi-particle poles of the scattering amplitudes…
We study Markov tree-shifts given by $k$ transition matrices, one for each of its $k$ directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and…
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…
We study fibres of the fertility map $\Phi$ from decorated rooted trees to decorated multi-index monomials. For a multi-index $\mathbf{k}$ of weight $-1$, the fibre $\mathcal F_{\mathbf{k}}=\{\,t:\Phi(t)=\xx^{\mathbf{k}}\,\}$ consists of…
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d in d dimensions under free, periodic, and…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
Linear extensions of posets are important objects in enumerative and algebraic combinatorics that are difficult to count in general. Families of posets like Young diagrams of straight shapes and $d$-complete posets have hook-length product…
A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir,…
This is the first of a series of detailed papers on string amplitudes with highly excited strings (HES). In the present paper we construct a generating function for string amplitudes with generic HES vertex operators using a fixed-loop…
As an alternative to the usual Feynman graphs, tree amplitudes in Yang-Mills theory can be constructed from tree graphs in which the vertices are tree level MHV scattering amplitudes, continued off shell in a particular fashion. The…
In this paper we present novel algorithmic techniques with a O(H(N)+N/H(N)) time complexity for performing several types of queries and updates on general rooted trees, binary search trees and lists of size N. For rooted trees we introduce…