4 papers
Enumerating Pattern-Avoiding Involutions using Combinatorial Exploration
Christian Bean, Anthony J. Guttmann, Jay Pantone
The enumeration of pattern-avoiding permutations has been a popular area of study over the past several decades, but comparatively little attention has been given to the topic of p…
Restricted Permutations Enumerated by Inversions
Atli Fannar Franklín, Anders Claesson, Christian Bean +2
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposab…
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…
The enumeration of inversion sequences avoiding the patterns 201 and 210
Jay Pantone
We derive the algebraic generating function for inversion sequences avoiding the patterns and by describing a set of succession rules, converting them to a system of ge…