Table of Contents
ISRN Combinatorics
Volume 2013, Article ID 806583, 17 pages
http://dx.doi.org/10.1155/2013/806583
Research Article

Generalized Pattern Avoidance Condition for the Wreath Product of Cyclic Groups with Symmetric Groups

1Department of Computer and Information Sceinces, University of Strathclyde Glasgow, Livingstone Tower, 26 Richmond Street, Glasgow G1 1XH, UK
2Department of Mathematics, University of California, San Diego, La Jolla, CA 92093, USA
3Department of Mathematics, University of Wisconsin Eau Claire, Eau Claire, WI 54702-4004, USA

Received 30 September 2012; Accepted 17 October 2012

Academic Editors: Y. Simsek and Y. Zhang

Copyright © 2013 Sergey Kitaev et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Kitaev, A. Niedermaier, J. B. Remmel, and A. Riehl, “Generalized pattern matching conditions for CkSn,” ISRN Combinatorics, vol. 2013, Article ID 634823, 20 pages, 2013. View at Publisher · View at Google Scholar
  2. E. S. Egge, “Restricted colored permutations and Chebyshev polynomials,” Discrete Mathematics, vol. 307, no. 14, pp. 1792–1800, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. T. Mansour, “Pattern avoidance in coloured permutations,” Séminaire Lotharingien de Combinatoire, vol. 46, article B46g, p. 12, 2001. View at Google Scholar · View at MathSciNet
  4. T. Mansour, “Coloured permutations containing and avoiding certain patterns,” Annals of Combinatorics, vol. 7, no. 3, pp. 349–355, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  5. T. Mansour and J. West, “Avoiding 2-letter signed patterns,” Séminaire Lotharingien de Combinatoire, vol. 49, article B49a, p. 11, 2002. View at Google Scholar · View at MathSciNet
  6. R. Simion, “Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations,” Electronic Journal of Combinatorics, vol. 7, no. 1, pp. 1–27, 2000. View at Google Scholar · View at MathSciNet · View at Scopus
  7. A. Duane and J. Remmel, “Minimal overlapping patterns in colored permutations,” Electronic Journal of Combinatorics, vol. 18, no. 2, p. 25, 2011. View at Google Scholar
  8. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, A Wiley-Interscience Publication, John Wiley & Sons, New York, NY, USA, 1983. View at MathSciNet
  9. A. Mendes and J. Remmel, “Permutations and words counted by consecutive patterns,” Advances in Applied Mathematics, vol. 37, no. 4, pp. 443–480, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. Ö. Eğecioğlu and J. B. Remmel, “Brick tabloids and the connection matrices between bases of symmetric functions,” Discrete Applied Mathematics, vol. 34, no. 1–3, pp. 107–120, 1991. View at Publisher · View at Google Scholar · View at MathSciNet