On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs Full article
| Journal |
Electronic Journal of Combinatorics
ISSN: 1077-8926 , E-ISSN: 1097-1440 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2023, Volume: 30, Number: 1, Article number : #P1.27, Pages count : 21 DOI: 10.37236/11199 | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
Abstract:
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 speci c enumerative results for POPs in permutations de ned by bipartite graphs, substantially extending the list of known results in this direction. In particular, we completely characterize the Wilf-equivalence for patterns de ned by the N-shape posets.
Cite:
Kitaev S.
, Pyatkin A.
On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs
Electronic Journal of Combinatorics. 2023. V.30. N1. #P1.27 :1-21. DOI: 10.37236/11199 WOS Scopus РИНЦ OpenAlex
On Permutations Avoiding Partially Ordered Patterns Defined by Bipartite Graphs
Electronic Journal of Combinatorics. 2023. V.30. N1. #P1.27 :1-21. DOI: 10.37236/11199 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Apr 19, 2022 |
| Accepted: | Jan 12, 2023 |
| Published online: | Feb 10, 2023 |
| Published print: | Mar 2, 2023 |
Identifiers:
| Web of science: | WOS:000945818500001 |
| Scopus: | 2-s2.0-85147662802 |
| Elibrary: | 60913155 |
| OpenAlex: | W4319722963 |