Related papers: On generating series of complementary planar trees
A planar tree power series over a field $K$ is a formal expression $$\sum c_T \cdot T$$ where the sum is extended over all isomorphism classes of finite planar reduced rooted trees $T$ and where the coefficients $c_T$ are in $K$.…
We introduce a new algebraic construction, {\em monop}, that combines monoids (with respect to the product of species), and operads (monoids with respect to the substitution of species) in the same algebraic structure. By the use of…
Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there does not exist a strictly smaller alcoved polytope containing it. The…
We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…
We study a partially ordered set of planar labeled rooted trees by use of combinatorial objects called Dyck tilings. A generating function of the poset is factorized when the minimum element of the poset is $312$-avoiding and satisfies some…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We consider two families of polynomials $\mathbb{P}=\polP$ and $\mathbb{Q}=\polQ$\footnote{Here and below we consider only monic polynomials.} orthogonal on the real line with respect to probability measures $\mu$ and $\nu$ respectively.…
We study a natural Lie algebra structure on the free vector space generated by all rooted planar trees as the associated Lie algebra of the nonsymmetric operad (non-$\Sigma$ operad, preoperad) of rooted planar trees. We determine whether…
This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new…
We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…
We develop the theory of root clusters further in this article and give some applications. We introduce some new notions as well as recall earlier notions for field extensions over a perfect base field: root cluster size, its generalization…
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…
In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…