No label defined (Q5333061)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3205162
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3205162

      Statements

      1964
      0 references
      number of non-map-isomorphic plane trees with n vertices
      0 references
      number of planted plane trees
      0 references
      number of unrooted plane trees
      0 references
      Otter's method
      0 references
      trivalent trees
      0 references
      0 references
      0 references
      0 references
      Two plane trees are called map-isomorphic if there exists an orientation-preserving homeomorphism of the plane onto itself which maps one onto the other. Using the well-known enumeration method of \textit{G. Pólya} [Acta Math. 68, 145--254 (1937; Zbl 0017.23202)], there are found for each positive integer \(n\), the number of non-map-isomorphic plane trees with \(n\) vertices. The number of planted plane trees, i. e. plane trees which are rooted at an end vertex, for each integer \(n\), are the coefficients of the series \[ \begin{aligned} P(x) = x^2 Z(I_\infty, x^{-1} P(x) &= \tfrac12 x(1-(1-4x)^{1/2}) = \\ &= x^2+x^3+2x^4+5x^5+14x^6+42x^7+\ldots \end{aligned} \] The number of unrooted plane trees are obtained by applying Otter's method as coefficients of the series \[ \begin{aligned} t(x) &= x Z(C_\infty, x^{-1} P(x)) - (1/2 x^2) (P^2(x)-P(x^2))= \\ &=x+x^2+x^3+2x^4+3x^5+6x^6+14x^7+\ldots \end{aligned} \] In the second part of the paper there are discussed trees in the plane closed by adjoining a point \(v_\infty\). Especially there are discussed trivalent trees, i.e. trees in which each vertex is either monovalent (an end vertex) or trivalent.
      0 references

      Identifiers