대한수학회지 (Journal of the Korean Mathematical Society)

  • 제53권1호
  • /
  • Pages.187-199
  • /
  • 2016
  • /
  • 0304-9914(pISSN)
  • /
  • 2234-3008(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지
DOI QR코드

DOI QR Code

A LINK BETWEEN ORDERED TREES AND GREEN-RED TREES

  • CHEON, GI-SANG (DEPARTMENT OF MATHEMATICS SUNGKYUNKWAN UNIVERSITY) ;
  • KIM, HANA (NATIONAL INSTITUTE FOR MATHEMATICAL SCIENCES) ;
  • SHAPIR, LOUIS W. (DEPARTMENT OF MATHEMATICS HOWARD UNIVERSITY)
  • 투고 : 2014.10.08
  • 발행 : 2016.01.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The r-ary number sequences given by $$(b^{(r)}_n)_{n{\geq}0}=\Large{\frac{1}{(r-1)n+1}}(^{rn}_n)$$ are analogs of the sequence of the Catalan numbers ${\frac{1}{n+1}}(^{2n}_n)$. Their history goes back at least to Lambert [8] in 1758 and they are of considerable interest in sequential testing. Usually, the sequences are considered separately and the generalizations can go in several directions. Here we link the various r first by introducing a new combinatorial structure related to GR trees and then algebraically as well. This GR transition generalizes to give r-ary analogs of many sequences of combinatorial interest. It also lets us find infinite numbers of combinatorially defined sequences that lie between the Catalan numbers and the Ternary numbers, or more generally, between $b^{(r)}_n$ and $b^{(r+1)}_n$.

키워드

참고문헌

  1. D. Davenport, L. Shapiro, and L. Woodson, The oldest child tree, Congr. Numer. 213 (2012), 123-131.
  2. N. Dershowitz and S. Zaks, Enumerations of ordered trees, Discrete Math. 31 (1980), no. 1, 9-28. https://doi.org/10.1016/0012-365X(80)90168-5
  3. E. Deutsch, Ordered trees with prescribed root degrees, node degrees, and branch lengths, Discrete Math. 282 (2004), no. 1-3, 89-94. https://doi.org/10.1016/j.disc.2003.10.021
  4. R. Donaghey and L.W. Shapiro, Motzkin numbers, J. Combin. Theory Ser. A 23 (1977), no. 3, 291-301. https://doi.org/10.1016/0097-3165(77)90020-6
  5. P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, 2009.
  6. R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics, 2nd Ed., Addison-Wesley, 1994.
  7. S. Heubach, N. Y. Li, and T. Mansour, A garden of k-Catalan structures, 2008. Available at: http://web.calstatela.edu/faculty/sheubac/papers/k-Catalan%20structures.pdf
  8. J. H. Lambert, Observations variae in Mathesin puram, Acta Helvetica 3 (1758), 128- 168.
  9. D. Merlini, D. G. Rogers, R. Sprugnoli, and M. C. Verri, On some alternative charac- terizations of Riordan arrays, Canad. J. Math. 49 (1997), no. 2, 301-320. https://doi.org/10.4153/CJM-1997-015-x
  10. J. H. Relethford, Human Population Genetics, 1st ed., Wiley-Blackwell, 2012.
  11. L. Shapiro, S. Getu, W.-J. Woan, and L. Woodson, The Riordan group, Discrete Appl. Math. 34 (1991), no. 1-3, 229-239. https://doi.org/10.1016/0166-218X(91)90088-E
  12. N. J. A. Sloane, The On-Line Encyclopedia of lnteger Sequences, http://www.research.att.com/-njas/sequences.
  13. R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994), no. 1-3, 267-290. https://doi.org/10.1016/0012-365X(92)00570-H
  14. R. P. Stanley, Enumerative Combinatorics, Cambridge University Press, Cambridge, 1999.
  15. R. P. Stanley, Catalan Numbers, 1st Ed., Cambridge University Press, New York, 2015.