3 citations · 3 across the 1 of their papers we have counts for
2 papers
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
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…