On permutations avoiding partially ordered patterns defined by bipartite graphs
From MaRDI portal
Publication:6396897
DOI10.37236/11199arXiv2204.08936MaRDI QIDQ6396897
Publication date: 19 April 2022
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.
This page was built for publication: On permutations avoiding partially ordered patterns defined by bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396897)
