On permutations avoiding partially ordered patterns defined by bipartite graphs (Q2684900)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On permutations avoiding partially ordered patterns defined by bipartite graphs |
scientific article; zbMATH DE number 7655022
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On permutations avoiding partially ordered patterns defined by bipartite graphs |
scientific article; zbMATH DE number 7655022 |
Statements
On permutations avoiding partially ordered patterns defined by bipartite graphs (English)
0 references
17 February 2023
0 references
Summary: 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.
0 references
0 references
0.9047286
0 references
0.8979989
0 references
0.8945102
0 references
0.88633037
0 references
0 references
