Output details
11 - Computer Science and Informatics
University of Strathclyde
Article title
New equivalences for pattern avoidance for involutions
Type
D - Journal article
Title of journal
Proceedings of the American Mathematical Society
Article number
-
Volume number
137
Issue number
2
First page of article
457
ISSN of journal
0002-9939
Year of publication
2009
URL
-
Number of additional authors
3
Additional information
<12>General Wilf-equivalence theorems are a major goal in the area of permutation patterns. This paper provides several new Wilf equivalence theorems for signed permutations and signed involutions, whose definitions are consistent with the classical permutations and involutions. As a result, the paper proves some conjectures of Jaggard that had been open for six years, and completes the classification into Involution-Wilf equivalence classes of patterns of length up to 7 and signed patterns of length up to 5. Consequently, it was accepted to one of the top general mathematical journals.
Interdisciplinary
-
Cross-referral requested
10 - Mathematical Sciences
Research group
A - Theoretical Computer Science
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
