On permutations avoiding partially ordered patterns defined by bipartite graphs

DOI10.37236/11199MaRDI QIDQ6396897arXivFDO

Authors Sergey Kitaev, Artem Pyatkin

Publication date 19 April 2022

Published in arXiv

Full work available at URL https://doi.org/10.37236/11199

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

arXiv classification

math.CO

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)