{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:43Z","timestamp":1759335523401},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00493-008-2314-0","type":"journal-article","created":{"date-parts":[[2008,8,8]],"date-time":"2008-08-08T04:02:48Z","timestamp":1218168168000},"page":"385-400","source":"Crossref","is-referenced-by-count":11,"title":["Decomposing simple permutations, with enumerative consequences"],"prefix":"10.1007","volume":"28","author":[{"given":"Robert","family":"Brignall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Huczynska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vatter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,8]]},"reference":[{"issue":"1\u20133","key":"2314_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2005.06.016","volume":"300","author":"M. H. Albert","year":"2005","unstructured":"M. H. Albert and M. D. Atkinson: Simple permutations and pattern restricted permutations, Discrete Math. 300(1\u20133) (2005), 1\u201315.","journal-title":"Discrete Math."},{"key":"2314_CR2","unstructured":"M. H. Albert, M. D. Atkinson and M. Klazar: The enumeration of simple permutations, J. Integer Seq. 6(4) (2003), Article 03.4.4, 18 pp. (electronic)."},{"issue":"1\u20133","key":"2314_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0012-365X(98)00162-9","volume":"195","author":"M. D. Atkinson","year":"1999","unstructured":"M. D. Atkinson: Restricted permutations, Discrete Math. 195(1\u20133) (1999), 27\u201338.","journal-title":"Discrete Math."},{"key":"2314_CR4","unstructured":"E. Babson and E. Steingr\u00edmsson: Generalized permutation patterns and a classification of the Mahonian statistics, S\u00e9m. Lothar. Combin. 44 (2000), Art. B44b, 18 pp. (electronic)."},{"issue":"4","key":"2314_CR5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1006\/aama.1997.0528","volume":"18","author":"M. B\u00f3na","year":"1997","unstructured":"M. B\u00f3na: The number of permutations with exactly r 132-subsequences is P-recursive in the size!, Adv. in Appl. Math. 18(4) (1997), 510\u2013522.","journal-title":"Adv. in Appl. Math."},{"issue":"1\u20133","key":"2314_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(97)00062-9","volume":"181","author":"M. B\u00f3na","year":"1998","unstructured":"M. B\u00f3na: Permutations with one or two 132-subsequences, Discrete Math. 181(1\u20133) (1998), 267\u2013274.","journal-title":"Discrete Math."},{"issue":"3","key":"2314_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcta.2007.06.007","volume":"115","author":"R. Brignall","year":"2008","unstructured":"R. Brignall, S. Huczynska and V. Vatter: Simple permutations and algebraic generating functions, J. Combin. Theory Ser. A 115(3) (2008), 423\u2013441.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1\u20132","key":"2314_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.tcs.2007.10.037","volume":"391","author":"R. Brignall","year":"2008","unstructured":"R. Brignall, N. Ru\u0161kuc and V. Vatter: Simple permutations: Decidability and unavoidable substructures, Theor. Comp. Sci, 391(1\u20132) (2008), 150\u2013163.","journal-title":"Theor. Comp. Sci"},{"issue":"2","key":"2314_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0196-8858(02)00012-X","volume":"29","author":"A. Claesson","year":"2002","unstructured":"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) (2002), 293\u2013310.","journal-title":"Adv. in Appl. Math."},{"key":"2314_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-0348-7915-6_1","volume-title":"Mathematics and computer science, III","author":"S. Corteel","year":"2004","unstructured":"S. Corteel, G. Louchard and R. Pemantle: Common intervals of permutations, in Mathematics and computer science, III, Trends Math., Birkh\u00e4user, Basel, 2004, pp. 3\u201314."},{"key":"2314_CR11","doi-asserted-by":"crossref","DOI":"10.1142\/4197","volume-title":"The theory of 2-structures","author":"A. Ehrenfeucht","year":"1999","unstructured":"A. Ehrenfeucht, T. Harju and G. Rozenberg: The theory of 2-structures, World Scientific Publishing Co. Inc., River Edge, NJ, 1999."},{"issue":"2","key":"2314_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/malq.19800260702","volume":"26","author":"S. F\u00f6ldes","year":"1980","unstructured":"S. F\u00f6ldes: On intervals in relational structures, Z. Math. Logik Grundlag. Math. 26(2) (1980), 97\u2013101.","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"4","key":"2314_CR13","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0196-8858(02)00501-8","volume":"30","author":"M. Fulmek","year":"2003","unstructured":"M. Fulmek: Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three, Adv. in Appl. Math. 30(4) (2003), 607\u2013632.","journal-title":"Adv. in Appl. Math."},{"issue":"1\u20133","key":"2314_CR14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0012-365X(96)00097-0","volume":"173","author":"P. Ille","year":"1997","unstructured":"P. Ille: Indecomposable graphs, Discrete Math. 173(1\u20133) (1997), 71\u201378.","journal-title":"Discrete Math."},{"issue":"2","key":"2314_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00026-003-0182-2","volume":"7","author":"T. Mansour","year":"2003","unstructured":"T. Mansour: Restricted 132-alternating permutations and Chebyshev polynomials, Ann. Comb. 7(2) (2003), 201\u2013227.","journal-title":"Ann. Comb."},{"key":"2314_CR16","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1155\/S0161171204304114","volume":"25\u201328","author":"T. Mansour","year":"2004","unstructured":"T. Mansour: Counting occurrences of 132 in an even permutation, Int. J. Math. Math. Sci. 25\u201328 (2004), 1329\u20131341.","journal-title":"Int. J. Math. Math. Sci."},{"issue":"2","key":"2314_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/aama.2001.0773","volume":"28","author":"T. Mansour","year":"2002","unstructured":"T. Mansour and A. Vainshtein: Counting occurrences of 132 in a permutation, Adv. in Appl. Math. 28(2) (2002), 185\u2013195.","journal-title":"Adv. in Appl. Math."},{"issue":"6","key":"2314_CR18","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.disc.2006.01.011","volume":"306","author":"T. Mansour","year":"2006","unstructured":"T. Mansour, S. H. F. Yan and L. L. M. Yang: Counting occurrences of 231 in an involution, Discrete Math. 306(6) (2006), 564\u2013572.","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"2314_CR19","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(95)00247-T","volume":"152","author":"J. Noonan","year":"1996","unstructured":"J. Noonan: The number of permutations containing exactly one increasing subsequence of length three, Discrete Math. 152(1\u20133) (1996), 307\u2013313.","journal-title":"Discrete Math."},{"issue":"4","key":"2314_CR20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/aama.1996.0016","volume":"17","author":"J. Noonan","year":"1996","unstructured":"J. Noonan and D. Zeilberger: The enumeration of permutations with a prescribed number of \u201cforbidden\u201d patterns, Adv. in Appl. Math. 17(4) (1996), 381\u2013407.","journal-title":"Adv. in Appl. Math."},{"key":"2314_CR21","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","volume":"76","author":"G. Sabidussi","year":"1961","unstructured":"G. Sabidussi: Graph derivatives, Math. Z. 76 (1961), 385\u2013401.","journal-title":"Math. Z."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2314-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-008-2314-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-008-2314-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:46Z","timestamp":1559079166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-008-2314-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["2314"],"URL":"https:\/\/doi.org\/10.1007\/s00493-008-2314-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}