论文标题
关于避免双方图定义的部分有序模式的排列
On permutations avoiding partially ordered patterns defined by bipartite graphs
论文作者
论文摘要
部分有序的模式（POP）概括了文献中在排列，单词，组成和分区中研究的经典模式的概念。在本文中，我们在双方图所定义的排列中给出了许多通用的，特定的枚举结果，从而大大扩展了已知结果的列表。特别是，我们完全表征了由N形Poset定义的模式的Wilf等效性。
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative results for POPs in permutations defined by bipartite graphs, substantially extending the list of known results in this direction. In particular, we completely characterize the Wilf-equivalence for patterns defined by the N-shape posets.
