Sur les polynômes de Catalan simples et doubles. (On simple and double Catalan polynomials) (Q1178022)

The author introduces two generalizations of the Catalan numbers, namely, a simple Catalan polynomial \(P_ m(u)\) and a double Catalan polynomial \(P_{m,n}(u)\). He then applies these polynomials to the solution of a previously unsolved problem about trees. Following \textit{N. Iwahori} [Science, Your Life and Ours, August 1982], for a finite tree \(T\) he defines an integer \(d(T)\), called the ``describer'' of \(T\), as follows: (1) \(d(\circ)=1\), where \(\circ\) is the tree with one vertex and no edges: (2) if \(T\) is a tree with \(n\) edges, numbered from 1 to \(n\), and \(T_ k'\), \(T_ k''\) are the two trees obtained by omitting the edge \(k\), then \(d(T)=\sum^ n_{k=1} d(T_ k') d(T_ k'')\). Now consider the family of trees \((u;m)\), each of which has \(u+m\) edges, of which \(u\) form a star whose central vertex is one end of a chain of length \(m\). It then follows that \(d(u;m)=u!P_ m(u)\). Finally, consider a family of trees \((u;m,n)\), each of which is defined by grafting a star with \(u\) edges to a vertex of a chain so that the chain has \(m\) edges on one side of the vertex, and \(n\) on the other side, then \(d(u;m,n)=u!P_{m,n}(u)\).