On permutations avoiding partially ordered patterns defined by bipartite graphs

DOI10.37236/11199OpenAlexW4319722963MaRDI QIDQ2684900

Artem V. Pyatkin, Sergey Kitaev

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.08936

Mathematics Subject Classification ID

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations avoiding certain partially-ordered patterns
• A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
• 2413-balloon permutations and the growth of the Möbius function
• On partially ordered patterns of length 4 and 5 in permutations
• 1324-avoiding permutations revisited
• Partially ordered generalized patterns
• The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations

This page was built for publication: On permutations avoiding partially ordered patterns defined by bipartite graphs