Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding

Christian Bean, Émile Nadeau, Jay Pantone +1

We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational gener…