Skip to main content Accessibility help
×
Home
Hostname: page-component-768ffcd9cc-jpcp9 Total loading time: 0.608 Render date: 2022-12-03T16:48:52.142Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

Generalized permutation patterns – a short survey

Published online by Cambridge University Press:  05 October 2010

Einar Steingrímsson
Affiliation:
The Mathematics Institute Reykjavík University IS-103 Reykjavík, Iceland
Steve Linton
Affiliation:
University of St Andrews, Scotland
Nik Ruškuc
Affiliation:
University of St Andrews, Scotland
Vincent Vatter
Affiliation:
Dartmouth College, New Hampshire
Get access

Summary

Abstract

An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern some letters of that subsequence may be required to be adjacent in the permutation. Subsets of permutations characterized by the avoidance–or the prescribed number of occurrences–of generalized patterns exhibit connections to an enormous variety of other combinatorial structures, some of them apparently deep. We give a short overview of the state of the art for generalized patterns.

Introduction

Patterns in permutations have been studied sporadically, often implicitly, for over a century, but in the last two decades this area has grown explosively, with several hundred published papers. As seems to be the case with most things in enumerative combinatorics, some instances of permutation patterns can be found already in MacMahon's classical book from 1915, Combinatory Analysis. In the seminal paper Restricted permutations of Simion and Schmidt from 1985 the systematic study of permutation patterns was launched, and it now seems clear that this field will continue growing for a long time to come, due to its plethora of problems that range from the easy to the seemingly impossible, with a rich middle ground of challenging but solvable problems.

Type
Chapter
Information
Permutation Patterns , pp. 137 - 152
Publisher: Cambridge University Press
Print publication year: 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] M. H., Albert, M., Elder, A., Rechnitzer, P., Westcott, and M., Zabrocki. On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia. Adv. in Appl. Math., 36(2):95–105, 2006.Google Scholar
[2] D., André. Développements de sec x et de tang x. C. R. Math. Acad. Sci. Paris, 88:965–967, 1879.Google Scholar
[3] D., André. Sur les permutations alternées. J. Math. Pures Appl., 7:167–184, 1881.Google Scholar
[4] E., Babson and E., Steingrímsson. Generalized permutation patterns and a classification of the Mahonian statistics. Sém. Lothar. Combin., 44:Article B44b, 18 pp., 2000.Google Scholar
[5] A., Bernini, L., Ferrari, and R., Pinzani. Enumeration of some classes of words avoiding two generalized patterns of length three. arXiv:0711.3387v1 [math.CO].
[6] A., Bernini, L., Ferrari, and R., Pinzani. Enumerating permutations avoiding three Babson-Steingrímsson patterns. Ann. Comb., 9(2):137–162, 2005.Google Scholar
[7] A., Bernini and E., Pergola. Enumerating permutations avoiding more than three Babson-Steingrímsson patterns. J. Integer Seq., 10(6):Article 07.6.4, 21 pp., 2007.Google Scholar
[8] M., Bóna. Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps. J. Combin. Theory Ser. A, 80(2):257–272, 1997.Google Scholar
[9] M., Bousquet-Mélou and S., Butler. Forest-like permutations. Ann. Comb., 11(3–4):335–354, 2007.Google Scholar
[10] W. G., Brown and W. T., Tutte. On the enumeration of rooted non-separable planar maps. Canad. J. Math., 16:572–577, 1964.Google Scholar
[11] A., Burstein and I., Lankham. Restricted patience sorting and barred pattern avoidance. In this volume, 233–257.
[12] A., Burstein and T., Mansour. Words restricted by 3-letter generalized multipermutation patterns. Ann. Comb., 7(1):1–14, 2003.Google Scholar
[13] D., Callan. A Wilf equivalence related to two stack sortable permutations. arXiv:math/0510211v1 [math.CO].
[14] D., Callan. A combinatorial interpretation of the eigensequence for composition. J. Integer Seq., 9(1):Article 06.1.4, 12 pp., 2006.Google Scholar
[15] F. R. K., Chung, R. L., Graham, V. E., Hoggatt, Jr., and M., Kleiman. The number of Baxter permutations. J. Combin. Theory Ser. A, 24(3):382–394, 1978.Google Scholar
[16] A., Claesson. Generalized pattern avoidance. European J. Combin., 22(7):961–971, 2001.Google Scholar
[17] A., Claesson, S., Kitaev, and E., Steingrímsson. Stack sorting, trees, and pattern avoidance. arXiv:0801.4037v1 [math.CO].
[18] A., Claesson and T., Mansour. Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations. Adv. in Appl. Math., 29(2):293–310, 2002.Google Scholar
[19] A., Claesson and T., Mansour. Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns. Ars Combin., 77:17–31, 2005.Google Scholar
[20] R. J., Clarke, E., Steingrímsson, and J., Zeng. New Euler-Mahonian statistics on permutations and words. Adv. in Appl. Math., 18(3):237–270, 1997.Google Scholar
[21] S., Corteel. Crossings and alignments of permutations. Adv. in Appl. Math., 38(2):149–163, 2007.Google Scholar
[22] S., Corteel and P., Nadeau. Bijections for permutation tableaux. European J. Combin., 30(1):295–310, 2009.Google Scholar
[23] S., Corteel and L. K., Williams. A Markov chain on permutations which projects to the PASEP. Int. Math. Res. Not. IMRN, 2007(17):Art. ID rnm055, 27, 2007.Google Scholar
[24] S., Corteel and L. K., Williams. Tableaux combinatorics for the asymmetric exclusion process. Adv. in Appl. Math., 39(3):293–310, 2007.Google Scholar
[25] S., Dulucq, S., Gire, and J., West. Permutations with forbidden subsequences and nonseparable planar maps. Discrete Math., 153(1-3):85–103, 1996.Google Scholar
[26] S., Elizalde. Asymptotic enumeration of permutations avoiding generalized patterns. Adv. in Appl. Math., 36(2):138–155, 2006.Google Scholar
[27] S., Elizalde and M., Noy. Consecutive patterns in permutations. Adv. in Appl. Math., 30(1-2):110–125, 2003.Google Scholar
[28] P., Flajolet. Combinatorial aspects of continued fractions. Discrete Math., 32(2):125–161, 1980.Google Scholar
[29] D., Foata and A., Randrianarivony. Two oiseau decompositions of permutations and their application to Eulerian calculus. European J. Combin., 27(3):342–363, 2006.Google Scholar
[30] D., Foata and D., Zeilberger. Denert's permutation statistic is indeed Euler-Mahonian. Stud. Appl. Math., 83(1):31–59, 1990.Google Scholar
[31] D., Foata and D., Zeilberger. Babson–Steingrímsson statistics are indeed Mahonian (and sometimes even Euler–Mahonian). Adv. in Appl. Math., 27(2–3):390–404, 2001.Google Scholar
[32] J., Françon and G., Viennot. Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'Euler et nombres de Genocchi. Discrete Math., 28(1):21–35, 1979.Google Scholar
[33] I. M., Gessel. Symmetric functions and P-recursiveness. J. Combin. Theory Ser. A, 53(2):257–285, 1990.Google Scholar
[34] S., Gire. Arbres, permutations à motifs exclus et cartes planaires: quelques problèmes algorithmique et combinatoire. PhD thesis, Université Bordeaux I, 1993.
[35] I. P., Goulden and D. M., Jackson. Combinatorial enumeration. Dover Publications Inc., Mineola, NY, 2004.Google Scholar
[36] J., Haglund. q-rook polynomials and matrices over finite fields. Adv. in Appl. Math., 20(4):450–487, 1998.Google Scholar
[37] M. T., Hardarson. personal communication. 2008.
[38] M. T., Hardarson. Avoidance of partially ordered generalized patterns of the form κ-σ-κ. arXiv:0805.1872v1 [math.CO].
[39] B., Jacquard and G., Schaeffer. A bijective census of nonseparable planar maps. J. Combin. Theory Ser. A, 83(1):1–20, 1998.Google Scholar
[40] S., Kitaev. Generalized pattern avoidance with additional restrictions. Sém. Lothar. Combin., 48:Article B48e, 19 pp., 2002.Google Scholar
[41] S., Kitaev. Multi-avoidance of generalised patterns. Discrete Math., 260(1-3):89–100, 2003.Google Scholar
[42] S., Kitaev. Partially ordered generalized patterns. Discrete Math., 298(1-3):212–229, 2005.Google Scholar
[43] S., Kitaev and T., Mansour. On multi-avoidance of generalized patterns. Ars Combin., 76:321–350, 2005.Google Scholar
[44] S., Kitaev and T., Mansour. Simultaneous avoidance of generalized patterns. Ars Combin., 75:267–288, 2005.Google Scholar
[45] P. A., MacMahon. Combinatory Analysis. Cambridge University Press, London, 1915/16.Google Scholar
[46] A., Marcus and G., Tardos. Excluded permutation matrices and the Stanley-Wilf conjecture. J. Combin. Theory Ser. A, 107(1):153–160, 2004.Google Scholar
[47] A., Mendes. Building generating functions brick by brick. PhD thesis, University of California, San Diego, 2004.
[48] A., Mendes and J. B., Remmel. Permutations and words counted by consecutive patterns. Adv. in Appl. Math., 37(4):443–480, 2006.Google Scholar
[49] J., Noonan and D., Zeilberger. The enumeration of permutations with a prescribed number of “forbidden” patterns. Adv. in Appl. Math., 17(4):381–407, 1996.Google Scholar
[50] E., Ouchterlony. On Young tableaux involutions and patterns in permutations. PhD thesis, Matematiska institutionen Linköpings Universitet, Linköping, Sweden, 2005.
[51] R., Parviainen. Lattice path enumeration of permutations with k occurrences of the pattern 2-13. J. Integer Seq., 9(3):Article 06.3.2, 8 pp., 2006.Google Scholar
[52] R., Simion and F. W., Schmidt. Restricted permutations. European J. Combin., 6(4):383–406, 1985.Google Scholar
[53] R., Simion and D., Stanton. Octabasic Laguerre polynomials and permutation statistics. J. Comput. Appl. Math., 68(1-2):297–329, 1996.Google Scholar
[54] E., Steingrímsson and L. K., Williams. Permutation tableaux and permutation patterns. J. Combin. Theory Ser. A, 114(2):211–234, 2007.Google Scholar
[55] J., West. Permutations with forbidden subsequences and stack-sortable permutations. PhD thesis, M.I.T., 1990.
[56] L. K., Williams. Enumeration of totally positive Grassmann cells. Adv. Math., 190(2):319–342, 2005.Google Scholar
[57] A., Woo and A., Yong. When is a Schubert variety Gorenstein?Adv. Math., 207(1):205–220, 2006.Google Scholar
[58] D., Zeilberger. The umbral transfer-matrix method. I. Foundations. J. Combin. Theory Ser. A, 91(1-2):451–463, 2000.Google Scholar
6
Cited by

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×