19 citations · 87 across the 21 of their papers we have counts for
Showing 2002 · math.COShow all
3 papers · 2 filters
math.CO2002★ 5 cited
A recursive bijective approach to counting permutations containing 3-letter patterns
David Callan
We present a method, illustrated by several examples, to find explicit counts of permutations containing a given multiset of three letter patterns. The method is recursive, dependi…
math.CO2002★ 12 cited
Pattern avoidance in circular permutations
David Callan
Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three le…
math.CO2002
Jordan and Smith forms of Pascal-related matrices
David Callan
We present matrix identities which yield respectively the Jordan canonical form of the Pascal matrix P_n = (i -1 choose j -1)_{1 <= i,j <= n} modulo a prime, the eigenvectors of (i…