arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0007194math.CO
收藏

避免来自$S_k$的模式和来自$S_3$的至少两个模式的置换

Permutations avoiding a pattern from $S_k$ and at least two patterns from $S_3$

T. Mansour

摘要:

在本文中,我们找到明确的公式或生成函数的集合$S_n(T,τ)$的所有排列在$S_n$,避免模式$τ\in S_k$和一个集$T$,$|T|\geq 2$,模式从$S_3$的基数。本文的主体分为三个部分,分别对应于$|T|=2,3$和$|T|\geq 4$两个案例。作为例子,在第五节中,我们得到了集合$S_n(T,τ)$对于$k=4$的所有基数的完全分类。

英文摘要:

In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,τ)$ of all permutations in $S_n$ that avoid a pattern $τ\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main body of the paper is divided into three sections corresponding to the cases $|T|=2,3$ and $|T|\geq 4$. As an example, in the fifth section, we obtain the complete classification of all cardinalities of the sets $S_n(T,τ)$ for $k=4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑