activity
20002013
most citedAvoiding 2-letter signed patterns

24 citations · 59 across the 6 of their papers we have counts for

collaborators

7 papers

math.CO2013★ 1 cited

The Dyck pattern poset

Antonio Bernini, Luca Ferrari, Renzo Pinzani +1

We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-contai…

math.CO2011★ 11 cited

Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions

Steven Linton, James Propp, Tom Roby +1

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our mo…

math.CO2009

Perfect matchings for the three-term Gale-Robinson sequences

Mireille Bousquet-Mélou, James Propp, Julian West

In 1991, David Gale and Raphael Robinson, building on explorations carried out by Michael Somos in the 1980s, introduced a three-parameter family of rational recurrence relations,…

math.CO2002★ 24 cited

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…

math.CO2001★ 2 cited

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…

math.CO2001★ 21 cited

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…