Wilf classification of three and four letter signed patterns

@article{Dukes2008WilfCO,
  title={Wilf classification of three and four letter signed patterns},
  author={W. Dukes and T. Mansour and A. Reifegerste},
  journal={Discret. Math.},
  year={2008},
  volume={308},
  pages={3125-3133}
}
  • W. Dukes, T. Mansour, A. Reifegerste
  • Published 2008
  • Mathematics, Computer Science
  • Discret. Math.
  • We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern avoidance by general as well as involutive signed permutations. 

    Tables and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    New equivalences for pattern avoiding involutions
    7
    Restricted Symmetric Signed Permutations
    2
    Permutation Patterns and Cell Decompositions
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    Signed Involutions Avoiding 2-Letter Signed Patterns
    3
    A New Class of Wilf-Equivalent Permutations
    56
    Classification of Forbidden Subsequences of Length 4
    67
    Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
    45
    Forbidden subsequences
    125
    Prefix Exchanging and Pattern Avoidance by Involutions
    21
    Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions
    30
    Generating trees and the Catalan and Schröder numbers
    • J. West
    • Computer Science, Mathematics
    • 1995
    261
    Restricted permutations
    432
    The Permutations 123p4…pm and 321p4…pm are Wilf-Equivalent
    24