Daniel Birmajer, J. Gil, David S. Kenepp, M. Weiner
{"title":"弱排序的受限生成树","authors":"Daniel Birmajer, J. Gil, David S. Kenepp, M. Weiner","doi":"10.46298/dmtcs.8350","DOIUrl":null,"url":null,"abstract":"Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated by inserting a new variable into each node at every step. A node becomes a leaf either after $n$ steps or when a certain stopping condition is met. In this paper we focus on conditions of size 2 ($x=y$, $x<y$, or $x\\le y$) and several conditions of size 3. Some of the cases considered here lead to the study of descent statistics of certain `almost' pattern-avoiding permutations.","PeriodicalId":110830,"journal":{"name":"Discret. Math. Theor. Comput. Sci.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Restricted generating trees for weak orderings\",\"authors\":\"Daniel Birmajer, J. Gil, David S. Kenepp, M. Weiner\",\"doi\":\"10.46298/dmtcs.8350\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated by inserting a new variable into each node at every step. A node becomes a leaf either after $n$ steps or when a certain stopping condition is met. In this paper we focus on conditions of size 2 ($x=y$, $x<y$, or $x\\\\le y$) and several conditions of size 3. Some of the cases considered here lead to the study of descent statistics of certain `almost' pattern-avoiding permutations.\",\"PeriodicalId\":110830,\"journal\":{\"name\":\"Discret. Math. Theor. Comput. Sci.\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Math. Theor. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.46298/dmtcs.8350\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Math. Theor. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/dmtcs.8350","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Motivated by the study of pattern avoidance in the context of permutations and ordered partitions, we consider the enumeration of weak-ordering chains obtained as leaves of certain restricted rooted trees. A tree of order $n$ is generated by inserting a new variable into each node at every step. A node becomes a leaf either after $n$ steps or when a certain stopping condition is met. In this paper we focus on conditions of size 2 ($x=y$, $x
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
