On permutations avoiding partially ordered patterns defined by bipartite graphs

Tools

Kitaev, Sergey and Pyatkin, Artem (2023) On permutations avoiding partially ordered patterns defined by bipartite graphs. The Electronic Journal of Combinatorics, 30 (1). P1.27. ISSN 1077-8926 (https://doi.org/10.37236/11199)

[thumbnail of Kitaev-Pyatkin-EJC-2023-On-permutations-avoiding-partially-ordered-patterns-defined-by-bipartite-graphs]
Preview
 Text. Filename: Kitaev_Pyatkin_EJC_2023_On_permutations_avoiding_partially_ordered_patterns_defined_by_bipartite_graphs.pdf
Final Published Version
License: Creative Commons Attribution-NoDerivatives 4.0 logo
Download (205kB)| Preview

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 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.

ORCID iDs

Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647 and Pyatkin, Artem;
CORE (COnnecting REpositories)