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

  • 제56권5호
  • /
  • Pages.1247-1263
  • /
  • 2019
  • /
  • 0304-9914(pISSN)
  • /
  • 2234-3008(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지
DOI QR코드

DOI QR Code

PICK TWO POINTS IN A TREE

  • Kim, Hana (Applied Algebra and Optimization Research Center Sungkyunkwan University) ;
  • Shapiro, Louis W. (Department of Mathematics Howard University)
  • 투고 : 2018.07.25
  • 심사 : 2018.10.11
  • 발행 : 2019.09.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In ordered trees, two randomly chosen vertices are said to be dependent if one lies under the other. If not, we say that they are independent. We consider several classes of ordered trees with uniform updegree requirements and find the generating functions for the trees with two marked dependent/independent vertices. As a result, we compute the probability for two vertices being dependent/independent. We also count such trees by the distance between two independent vertices.

키워드

DBSHBB_2019_v56n5_1247_f0001.png 이미지

FIGURE 1. Distribution of pairs of leaves in complete binary trees with 10 edges by distance.

DBSHBB_2019_v56n5_1247_f0002.png 이미지

FIGURE 2. Distribution of complete binary trees with two marked leaves at a given distance by the number of edges. Di erent colors are used to distinguish the distances between two leaves.

참고문헌

  1. G.-S. Cheon, H. Kim, and L. W. Shapiro, Profiles of ordered trees with mutation and associated Riordan matrices, Linear Algebra Appl. 511 (2016), 296-317. https://doi.org/10.1016/j.laa.2016.09.006
  2. G.-S. Cheon and L. W. Shapiro, Protected points in ordered trees, Appl. Math. Lett. 21 (2008), no. 5, 516-520. https://doi.org/10.1016/j.aml.2007.07.001
  3. M. Drmota, Random Trees, Springer Verlag, Wien, 2009. https://doi.org/10.1007/978-3-211-75357-6
  4. P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, 2009. https://doi.org/10.1017/CBO9780511801655
  5. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, second edition, Addison-Wesley Publishing Company, Reading, MA, 1994.
  6. N. C. Jones and P. A. Pevzner, An Introduction to Bioinformatics Algorithms, MIT Press, 2004.
  7. C. Semple and M. Steel, Phylogenetics, Oxford Lecture Series in Mathematics and its Applications, 24, Oxford University Press, Oxford, 2003.
  8. N. J. A. Sloane, The on-line encyclopedia of integer sequences, http://oeis.org.
  9. R. P. Stanley, Hipparchus, Plutarch, Schroder, and Hough, Amer. Math. Monthly 104 (1997), no. 4, 344-350. https://doi.org/10.2307/2974582
  10. R. P. Stanley, Enumerative Combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, 62, Cambridge University Press, Cambridge, 1999. https://doi.org/10.1017/CBO9780511609589