{"title":"PICK TWO POINTS IN A TREE","authors":"Hana Kim, L. Shapiro","doi":"10.4134/JKMS.J180503","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":49993,"journal":{"name":"Journal of the Korean Mathematical Society","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Korean Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4134/JKMS.J180503","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
This journal endeavors to publish significant research of broad interests in pure and applied mathematics. One volume is published each year, and each volume consists of six issues (January, March, May, July, September, November).