Restricted generating trees for weak orderings

Discret. Math. Theor. Comput. Sci. Pub Date : 2021-08-09 DOI:10.46298/dmtcs.8350

Daniel Birmajer, J. Gil, David S. Kenepp, M. Weiner

引用次数: 0

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

查看原文本刊更多论文

弱排序的受限生成树

基于排列和有序划分下的模式回避问题的研究，我们考虑了作为受限根树叶子的弱序链的枚举。通过在每一步向每个节点插入一个新变量，生成一个阶为$n$的树。节点在$n$步之后或满足某个停止条件时成为叶子。本文主要讨论了大小为2的条件($x=y$， $x

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

求助全文

约1分钟内获得全文求助全文

来源期刊