Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 634823, 20 pages
http://dx.doi.org/10.1155/2013/634823
Research Article

Generalized Pattern-Matching Conditions for

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

Received 3 May 2012; Accepted 1 July 2012

Academic Editors: S. D. Georgiou and J. Siemons

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. 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 Zentralblatt MATH · View at MathSciNet
  2. T. Mansour, “Pattern avoidance in coloured permutations,” Séminaire Lotharingien de Combinatoire, vol. 46, article B46g, 12 pages, 2001. View at Google Scholar · View at MathSciNet
  3. 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 Zentralblatt MATH · View at MathSciNet
  4. T. Mansour and J. West, “Avoiding 2-letter signed patterns,” Séminaire Lotharingien de Combinatoire, vol. 49, article B49a, 11 pages, 2002. View at Google Scholar · View at MathSciNet
  5. R. Simion, “Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations,” Electronic Journal of Combinatorics, vol. 7, no. 1, article R9, pp. 1–27, 2000. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. F. Brenti, “Permutation enumeration, symmetric functions, and unimodality,” Pacific Journal of Mathematics, vol. 157, pp. 1–28, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. F. Brenti, “A class of q-symmetric functions arising from plethysm,” Journal of Combinatorial Theory Series A, vol. 91, no. 1-2, pp. 137–170, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. D. A. Beck, J. B. Remmel, and T. Whitehead, “The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues,” Discrete Mathematics, vol. 153, no. 1–3, pp. 3–27, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. T. M. Langley, “Alternative transition matrices for Brenti's q-symmetric functions and a class of q, t-symmetric functions on the hyperoctahedral group,” in Proceedings of the Formal Power Series and Algebraic Combinatorics Conference, Melbourne, Australia, 2002.
  10. T. M. Langley and J. B. Remmel, “Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions,” Advances in Applied Mathematics, vol. 36, no. 1, pp. 30–66, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. A. Mendes and J. B. Remmel, “Generating functions from symmetric functions,” preprint.
  13. A. Ram, J. B. Remmel, and T. Whitehead, “Combinatorics of the q-basis of symmetric functions,” Journal of Combinatorial Theory Series A, vol. 76, no. 2, pp. 231–271, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. D. Wagner, “The permutation enumeration of wreath products CkSn of cyclic and symmetric groups,” Advances in Applied Mathematics, vol. 30, no. 1-2, pp. 343–368, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. A. Mendes, Building generating functions brick by brick [Ph.D. thesis], University of California, San Diego, Calif, USA, 2004. View at MathSciNet
  16. N. J. A. Sloane, Ed., Online Encyclopedia of Integer Sequences, 2009, http://oeis.org/.
  17. Ö. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. L. Carlitz, “Sequences and inversions,” Duke Mathematical Journal, vol. 37, pp. 193–198, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. A. Mendes, J. B. Remmel, and A. Riehl, “Permutations with k-regular descent patterns,” Annals of Combinatorics. In press. View at Publisher · View at Google Scholar · View at MathSciNet
  20. S. Kitaev, Patterns in Permutations and Words, EATCS Monographs in Theoretical Computer Science Book Series, Springer, 2011.
  21. A. Duane and J. B. Remmel, “Minimal overlapping patterns in colored permutations,” The Electronic Journal of Combinatorics, vol. 18, no. 2, 2011. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet