Related papers: New hook length formulas for binary trees
We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…
It is known that there is a Hopf algebra structure on the vector space with basis all heap-ordered trees. We give a new bialgebra structure on the space with basis all permutations and show that there is a direct bialgebra isomorphism…
We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…
We apply so-called tree straight-line programs to the problem of lossless compression of binary trees. We derive upper bound on the maximal pointwise redundancy (or worst-case redundancy) that improve previous bounds obtained by Zhang,…
The register function (or Horton-Strahler number) of a binary tree is a well-known combinatorial parameter. We study a reduction procedure for binary trees which offers a new interpretation for the register function as the maximal number of…
For lengths $36$, $48$ and $60$, we construct new ternary near-extremal self-dual codes with weight enumerators for which no ternary near-extremal self-dual codes were previously known to exist.
We study the average height of random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every $n \geq 2$ a probability distribution on the set of…
In this paper, we study certain inequalities and a related result for weighted Sobolev spaces on H\"older-$\alpha$ domains, where the weights are powers of the distance to the boundary. We obtain results regarding the divergence equation's…
In this paper, estimates for Kolmogorov, Gelfand and linear widths of function classes on sets with a tree-like structure are obtained. As examples we consider weighted Sobolev classes on a John domain, as well as some function classes on a…
In this article, we propose tree edit distance with variables, which is an extension of the tree edit distance to handle trees with variables and has a potential application to measuring the similarity between mathematical formulas,…
This work proves new probability bounds relating to the height, width, and size of Galton-Watson trees. For example, if $T$ is any Galton-Watson tree, and $H$, $W$, and $|T|$ are the height, width, and size of $T$, respectively, then $H/W$…
This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…
A new lower bound for the maximal length of a multivector is obtained. It is much closer to the best known upper bound than previously reported lower bound estimates. The maximal length appears to be unexpectedly large for $n$-vectors, with…
We introduce a proof system for Hajek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable…
In this paper we introduce and study three new measures for efficient discriminative comparison of phylogenetic trees. The NNI navigation dissimilarity $d_{nav}$ counts the steps along a "combing" of the Nearest Neighbor Interchange (NNI)…
We suggest a new non-recursive algorithm for constructing a binary search tree given an array of numbers. The algorithm has $O(N)$ time and $O(1)$ memory complexity if the given array of $N$ numbers is sorted. The resulting tree is of…
The phylogenetic tree space introduced by Billera, Holmes, and Vogtmann (BHV tree space) is a CAT(0) continuous space that represents trees with edge weights with an intrinsic geodesic distance measure. The geodesic distance measure unique…
We present and prove a formula for the MHV scattering amplitude of n gravitons at tree level. Some of the more interesting features of the formula, which set it apart as being significantly different from many more familiar formulas,…
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…
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…