An Asymptotic Ratio in the Complete Binary Tree


Let Tn be the complete binary tree of height n considered as the Hasse-diagram of a poset with its root 1n as the maximum element. For a rooted tree T , define two functions counting the embeddings of T into Tn as follows A(n;T ) = |{S ⊆ Tn : 1n ∈ S, S ∼= T }|, and B(n; T ) = |{S ⊆ Tn : 1n / ∈ S, S ∼= T }|. In this paper we investigate the asymptotic… (More)
DOI: 10.1023/B:ORDE.0000009243.79750.85


1 Figure or Table