在树上选两个点

Pub Date : 2019-01-01 DOI:10.4134/JKMS.J180503

Hana Kim, L. Shapiro

{"title":"在树上选两个点","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":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4134/JKMS.J180503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4134/JKMS.J180503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在有序树中，两个随机选择的顶点是相互依赖的，如果其中一个位于另一个的下面。如果不是，我们说它们是独立的。我们考虑了几类具有一致上度要求的有序树，并找到了具有两个标记的相关/独立顶点的树的生成函数。因此，我们计算两个顶点依赖/独立的概率。我们还通过两个独立顶点之间的距离来计算这样的树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

PICK TWO POINTS IN A TREE

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助