Embeddings and Other Mappings of Rooted Trees Into Complete Trees

Abstract

Let Tn be the complete binary tree of height n, with root 1n as the maximum element. For T a tree, define \(A(n;T) = \vert{ \{S \subseteq T^{n} : 1_{n} \in S, S \cong T\} \vert}\) and \(C(n;T) = \vert{ \{S \subseteq T^{n} : S \cong T\} \vert}\). We disprove a conjecture of Kubicki, Lehel and Morayne, which claims that \(\frac{A(n;T_1)}{C(n;T_1)} \leq \frac{A(n;T_2)}{C(n;T_2)}\) for any fixed n and arbitrary rooted trees T1T2. We show that A(n; T) is of the form \(\sum_{j=0}^lq_j(n) 2^{jn}\) where l is the number of leaves of T, and each qj is a polynomial. We provide an algorithm for calculating the two leading terms of ql for any tree T. We investigate the asymptotic behaviour of the ratio A(n; T)/C(n; T) and give examples of classes of pairs of trees T1, T2 where it is possible to compare A(n; T1)/C(n; T1) and A(n; T2)/C(n; T2). By calculating these ratios for a particular class of pairs of trees, we show that the conjecture fails for these trees, for all sufficiently large n. Kubicki, Lehel and Morayne have proved the conjecture when T1, T2 are restricted to being binary trees. We also look at embeddings into other complete trees, and we show how the result can be viewed as one of many possible correlation inequalities for embeddings of binary trees. We also show that if we consider strict order-preserving maps of T1, T2 into Tn (rather than embeddings) then the corresponding correlation inequalities for these maps also generalise to arbitrary trees.