Finite prefix codes and finatary trees
The Bulletin of Irkutsk State University. Series Mathematics, Tome 6 (2013) no. 3, pp. 38-47
Cet article a éte moissonné depuis la source Math-Net.Ru
We find an explicit formula for the number of all $p$-ary $k$-trees with $m$ leaves. Analyzing this formula, we arrive at a number of combinatorial identities.
Keywords:
tree; prefix code; generating function; Fuss number; Catalan number; Motzkin language.
@article{IIGUM_2013_6_3_a2,
author = {I. O. Koryakov},
title = {Finite prefix codes and finatary trees},
journal = {The Bulletin of Irkutsk State University. Series Mathematics},
pages = {38--47},
year = {2013},
volume = {6},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IIGUM_2013_6_3_a2/}
}
I. O. Koryakov. Finite prefix codes and finatary trees. The Bulletin of Irkutsk State University. Series Mathematics, Tome 6 (2013) no. 3, pp. 38-47. http://geodesic.mathdoc.fr/item/IIGUM_2013_6_3_a2/
[1] I. O. Koryakov, “Silno prefiksnye kody i obobschennaya formula Reini”, Izv. Ural. gos. un-ta, 2010, no. 74, 57–66 | MR
[2] Zh. Lalleman, Polugruppy i kombinatornye prilozheniya, Mir, M., 1985 | MR
[3] L. W. Shapiro, “Positive definite matrices and Catalan numbers”, Proc. Amer. Math. Soc., 90:3 (1984), 488–496 | DOI | MR
[4] H. Izbicki, “Über Unterbäume eines Baumes”, Monatsh. Math., 74 (1970), 56–62 | DOI | MR
[5] J. Riordan, “A note on Catalan parentheses”, Amer. Math. Monthly, 80 (1973), 904–906 | DOI | MR
[6] L. W. Shapiro, “A short proof of an identity of Touchard's concerning Catalan numbers”, J. Combinatorial Theory. Ser. A, 20:3 (1976), 375–376 | DOI | MR