Korean Journal of Mathematics

The Kangwon-Kyungki Mathematical Society (강원경기수학회)
권호 표지
DOI QR코드

DOI QR Code

A REFINEMENT FOR ORDERED LABELED TREES

  • Seo, Seunghyun (Department of Mathematics Education Kangwon National University) ;
  • Shin, Heesung (Department of Mathematics Inha University)
  • Received : 2012.05.03
  • Accepted : 2012.06.18
  • Published : 2012.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Let $\mathcal{O}_n$ be the set of ordered labeled trees on $\{0,\;{\ldots},\;n\}$. A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\mathcal{O}_{n,k}$ of $\mathcal{O}_n$, which is the set of ordered labeled trees whose maximal decreasing subtree has $k+1$ vertices.

Keywords

References

  1. William Y. C. Chen, Larry X. W. Wang and Arthur L. B. Yang. Recurrence relations for strongly q-log-convex polynomial, Canad. Math. Bull., 54 (2) (2011), 217-229. https://doi.org/10.4153/CMB-2011-008-5
  2. Brian Drake, An inversion theorem for labeled trees and some limits of areas under lattice paths, ProQuest LLC, Ann Arbor, MI, 2008. Thesis (Ph.D.)-Brandeis University.
  3. Martin Klazar, Twelve countings with rooted plane trees, European J. Combin., 18 (2) (1997), 195-210. https://doi.org/10.1006/eujc.1995.0095
  4. Seunghyun Seo and Heesung Shin, A generalized enumeration of labeled trees and reverse Prufer algorithm, J. Combin. Theory Ser. A, 114 (7) (2007), 1357-1361. https://doi.org/10.1016/j.jcta.2007.01.010
  5. Seunghyun Seo and Heesung Shin, On the enumeration of rooted trees with xed size of maximal decreasing trees, Discrete Math., 312 (2) (2012), 419-426. https://doi.org/10.1016/j.disc.2011.10.001
  6. Peter W. Shor, A new proof of Cayley's formula for counting labeled trees, J. Combin. Theory Ser. A, 71 (1) (1995), 154-158. https://doi.org/10.1016/0097-3165(95)90022-5
  7. Richard P. Stanley, Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin.
  8. Jiang Zeng, A Ramanujan sequence that re nes the Cayley formula for trees, Ramanujan J., 3 (1) (1999), 45-54. https://doi.org/10.1023/A:1009809224933

Cited by

  1. A REFINED ENUMERATION OF p-ARY LABELED TREES vol.21, pp.4, 2012, https://doi.org/10.11568/kjm.2013.21.4.495