10 citations · 16 across the 7 of their papers we have counts for
8 papers · 1 filter
Ascent sequences avoiding pairs of patterns
Andrew M. Baxter, Lara K. Pudwell
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steing…
Refining enumeration schemes to count according to permutation statistics
Andrew M. Baxter
We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoid…
Some Wilf-equivalences for vincular patterns
Andrew M. Baxter, Mark Shattuck
We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for t…
Shape-Wilf-equivalences for vincular patterns
Andrew M. Baxter
We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as "generalized patterns" or "dashed patterns"). First we introduce a stronger equivalence on patter…
Enumeration schemes for vincular patterns
Andrew M. Baxter, Lara K. Pudwell
We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In part…
Pattern avoidance by even permutations
Andrew M. Baxter, Aaron D. Jaggard
We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although s…