17 citations · 38 across the 9 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2011
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…
math.CO2003★ 3 cited
Prefix exchanging and pattern avoidance by involutions
Aaron D. Jaggard
Let I_n(π) denote the number of involutions in the symmetric group S_n which avoid the permutation π. We say that two permutations α,β\in§{j} may be exchanged if for every n, k, an…
math.CO2001★ 1 cited
Subsequence containment by involutions
Aaron D. Jaggard
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation τin S_k as a subsequence; this number depends on the…