24 citations · 24 across the 1 of their papers we have counts for
4 papers · 1 filter
Avoiding 2-letter signed patterns
T. Mansour, J. West
Let B_n be the hyperoctahedral group; that is, the set of all signed permutations on n letters, and let B_n(T) be the set of all signed permutations in B_n which avoids a set T of…
Explicit Enumeration of 321,Hexagon-Avoiding Permutations
Zvezdelina Stankova-Frenkel, Julian West
The 321,hexagon-avoiding (321-hex) permutations were introduced and studied by Billey and Warrington in as a class of elements of S_n whose Kazhdan-Lusztig and Poincare polynomials…
A New Class of Wilf-Equivalent Permutations
Zvezdelina Stankova-Frenkel, Julian West
For about 10 years, the classification of permutation patterns was thought completed up to length 6. In this paper, we establish a new class of Wilf-equivalent permutation patterns…
Complementary Algorithms For Tableaux
Tom Roby, Frank Sottile, Jeffrey Stroomer +1
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fou…