论文标题
加泰罗尼亚和Schröder排列可按两个限制堆栈排序
Catalan and Schröder permutations sortable by two restricted stacks
论文作者
论文摘要
Claesson，Cerbai和Ferrari最近引入了避开机器的模式，作为串联排序装置中两堆的特殊情况。它们由两个串联的限制堆栈组成，由正确的绿色程序统治，堆栈避免了一些指定的模式。某些获得的结果已通过CERBAI进一步推广到Cayley置换术，该结果由Defant和Zheng专门针对特定模式，或者在Berlow对对称组的功能中考虑。在这项工作中，我们研究了避开机器的模式，其中第一个堆栈避免了一对长度3的模式，并研究了那些对可排序排列的对（由加泰罗尼亚数字的二项式变换和schröder数字）计数的。
Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the stacks avoid some specified patterns. Some of the obtained results have been further generalized to Cayley permutations by Cerbai, specialized to particular patterns by Defant and Zheng, or considered in the context of functions over the symmetric group by Berlow. In this work we study pattern avoiding machines where the first stack avoids a pair of patterns of length 3 and investigate those pairs for which sortable permutations are counted by the (binomial transform of the) Catalan numbers and the Schröder numbers.
