{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:55:39Z","timestamp":1776848139363,"version":"3.51.2"},"reference-count":40,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package<jats:sc>WilfPlus<\/jats:sc>, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.<\/jats:p>","DOI":"10.1017\/s0963548307008516","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T07:45:44Z","timestamp":1180683944000},"page":"137-159","source":"Crossref","is-referenced-by-count":14,"title":["Enumeration Schemes for Restricted Permutations"],"prefix":"10.1017","volume":"17","author":[{"given":"VINCENT","family":"VATTER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,1,1]]},"reference":[{"key":"S0963548307008516_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011279130416"},{"key":"S0963548307008516_ref2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.37236\/1944","article-title":"The insertion encoding of permutations","volume":"12","author":"Albert","year":"2005","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref30","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100003844"},{"key":"S0963548307008516_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF01608488"},{"key":"S0963548307008516_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s000260200008"},{"key":"S0963548307008516_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90242-9"},{"key":"S0963548307008516_ref29","first-page":"257","volume-title":"Algebraic and Combinatorial Methods in Operations Research","author":"M\u00f6hring","year":"1984"},{"key":"S0963548307008516_ref24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.37236\/1922","article-title":"Wilf classes of pairs of permutations of length 4","volume":"12","author":"Le","year":"2005","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.37236\/1691","article-title":"Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels","volume":"9","author":"Bousquet-M\u00e9lou","year":"2003","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref18","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compos. Math."},{"key":"S0963548307008516_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00209-3"},{"key":"S0963548307008516_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.10.003"},{"key":"S0963548307008516_ref34","volume-title":"Cambridge Studies in Advanced Mathematics","author":"Stanley","year":"1997"},{"key":"S0963548307008516_ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016500300436"},{"key":"S0963548307008516_ref25","volume-title":"Combinatory Analysis","author":"MacMahon","year":"1915"},{"key":"S0963548307008516_ref3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.37236\/1344","article-title":"Permutations which are the union of an increasing and a decreasing subsequence","volume":"5","author":"Atkinson","year":"1998","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589"},{"key":"S0963548307008516_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90068-7"},{"key":"S0963548307008516_ref7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.37236\/1957","article-title":"Pattern avoidance classes and subpermutations","volume":"12","author":"Atkinson","year":"2005","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.07.019"},{"key":"S0963548307008516_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00042-6"},{"key":"S0963548307008516_ref12","unstructured":"[12] Brignall R. , Ru\u0161kuc N. and Vatter V. Simple permutations: Decidability and unavoidable substructures. arXiv:math.CO\/0609211."},{"key":"S0963548307008516_ref17","unstructured":"[17] Elder M. and Vatter V. (2005) Problems and conjectures presented at the Third International Conference on Permutation Patterns, University of Florida, March 7\u201311. arXiv:math.CO\/0505504."},{"key":"S0963548307008516_ref27","first-page":"461","article-title":"On an open problem of Green and Losonczy: Exact enumeration of freely braided permutations","volume":"6","author":"Mansour","year":"2004","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S0963548307008516_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.06.016"},{"key":"S0963548307008516_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00067-1"},{"key":"S0963548307008516_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)83023-8"},{"key":"S0963548307008516_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00270-5"},{"key":"S0963548307008516_ref8","doi-asserted-by":"publisher","DOI":"10.1080\/10236199908808200"},{"key":"S0963548307008516_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(90)90060-A"},{"key":"S0963548307008516_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00302-7"},{"key":"S0963548307008516_ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.06.003"},{"key":"S0963548307008516_ref39","doi-asserted-by":"publisher","DOI":"10.2307\/2321713"},{"key":"S0963548307008516_ref21","unstructured":"[21] Knuth D. E. (1969) The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, Reading, MA."},{"key":"S0963548307008516_ref4","first-page":"117","volume-title":"Aust. Comput. Sci. Commun.","author":"Atkinson","year":"1999"},{"key":"S0963548307008516_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"S0963548307008516_ref31","unstructured":"[31] Sloane N. J. A. The On-line Encyclopedia of Integer Sequences. Available online at: http:\/\/www.research.att.com\/~njas\/sequences\/."},{"key":"S0963548307008516_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00384-7"},{"key":"S0963548307008516_ref28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.37236\/1677","article-title":"321-polygon-avoiding permutations and Chebyshev polynomials","volume":"9","author":"Mansour","year":"2003","journal-title":"Electron. J. Combin."},{"key":"S0963548307008516_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04166-6_69"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548307008516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T16:32:07Z","timestamp":1587573127000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548307008516\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["S0963548307008516"],"URL":"https:\/\/doi.org\/10.1017\/s0963548307008516","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}