{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:06:03Z","timestamp":1648991163923},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11786-018-0353-5","type":"journal-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T03:44:36Z","timestamp":1530503076000},"page":"169-183","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Permutation Patterns and Cell Decompositions"],"prefix":"10.1007","volume":"13","author":[{"given":"Toufik","family":"Mansour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Schork","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"353_CR1","first-page":"1","volume":"71","author":"H Abe","year":"2016","unstructured":"Abe, H., Billey, S.: Consequences of the Lakshmibai\u2013Sandhya theorem: the ubiquity of permutation patterns in Schubert calculus and related geometry. Adv. Stud. Pure Math. 71, 1\u201352 (2016)","journal-title":"Adv. Stud. Pure Math."},{"key":"353_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.37236\/1944","volume":"12","author":"MH Albert","year":"2005","unstructured":"Albert, M.H., Linton, S., Rus\u0306kuc, N.: The insertion encoding of permutations. Electron. J. Comb. 12, 47 (2005)","journal-title":"Electron. J. Comb."},{"key":"353_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.jcta.2017.09.006","volume":"154","author":"T Alland","year":"2018","unstructured":"Alland, T., Richmond, E.: Pattern avoidance and fiber bundle structures on Schubert varieties. J. Comb. Ser. A 154, 533\u2013550 (2018)","journal-title":"J. Comb. Ser. A"},{"key":"353_CR4","first-page":"5","volume":"19","author":"D Callan","year":"2017","unstructured":"Callan, D., Mansour, T., Shattuck, M.: Wilf classification of triples of 4-letter patterns I. Discrete Math. Theor. Comput. Sci. 19, 5 (2017)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"353_CR5","first-page":"6","volume":"19","author":"D Callan","year":"2017","unstructured":"Callan, D., Mansour, T., Shattuck, M.: Wilf classification of triples of 4-letter patterns II. Discrete Math. Theor. Comput. Sci. 19, 6 (2017)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"353_CR6","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, 3rd edn. Addison Wesley, Reading (1997)","edition":"3"},{"key":"353_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0012-365X(03)00042-6","volume":"268","author":"D Kremer","year":"2003","unstructured":"Kremer, D., Shiu, W.C.: Finite transition matrices for permutations avoiding pairs of length four patterns. Discrete Math. 268, 171\u2013183 (2003)","journal-title":"Discrete Math."},{"key":"353_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.37236\/1922","volume":"12","author":"I Le","year":"2005","unstructured":"Le, I.: Wilf classes of pairs of permutations of length 4. Electron. J. Comb. 12, 25 (2005)","journal-title":"Electron. J. Comb."},{"key":"353_CR9","first-page":"1","volume":"8","author":"T Mansour","year":"2016","unstructured":"Mansour, T., Schork, M.: Wilf classification of subsets of four letter patterns. J. Comb. Number Theory 8, 1\u2013129 (2016)","journal-title":"J. Comb. Number Theory"},{"key":"353_CR10","first-page":"257","volume":"8","author":"T Mansour","year":"2016","unstructured":"Mansour, T., Schork, M.: Wilf classification of subsets of eight and nine four-letter patterns. J. Comb. Number Theory 8, 257\u2013283 (2016)","journal-title":"J. Comb. Number Theory"},{"key":"353_CR11","first-page":"169","volume":"9","author":"T Mansour","year":"2017","unstructured":"Mansour, T., Schork, M.: Wilf classification of subsets of six and seven four-letter patterns. J. Comb. Number Theory 9, 169\u2013213 (2017)","journal-title":"J. Comb. Number Theory"},{"key":"353_CR12","unstructured":"Mansour, T., Schork, M.: Wilf classification of subsets of five four-letter patterns. (in preparation)"},{"key":"353_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R Simion","year":"1985","unstructured":"Simion, R., Schmidt, F.W.: Restricted permutations. Eur. J. Comb. 6, 383\u2013406 (1985)","journal-title":"Eur. J. Comb."},{"key":"353_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(94)90242-9","volume":"132","author":"ZE Stankova","year":"1994","unstructured":"Stankova, Z.E.: Forbidden subsequences. Discrete Math. 132, 291\u2013316 (1994)","journal-title":"Discrete Math."},{"key":"353_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/eujc.1996.0044","volume":"17","author":"ZE Stankova","year":"1996","unstructured":"Stankova, Z.E.: Classification of forbidden subsequences of length four. Eur. J. Comb. 17, 501\u2013517 (1996)","journal-title":"Eur. J. Comb."},{"key":"353_CR16","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1112\/plms\/pdt004","volume":"107","author":"H \u00dalfarsson","year":"2013","unstructured":"\u00dalfarsson, H., Woo, A.: Which Schubert varieties are local complete intersections? Proc. Lond. Math. Soc. 107, 1004\u20131052 (2013)","journal-title":"Proc. Lond. Math. Soc."},{"key":"353_CR17","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.jsc.2005.10.003","volume":"41","author":"V Vatter","year":"2006","unstructured":"Vatter, V.: Finitely labeled generating trees and restricted permutations. J. Symb. Comput. 41, 559\u2013572 (2006)","journal-title":"J. Symb. Comput."},{"key":"353_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.jsc.2011.11.002","volume":"47","author":"V Vatter","year":"2012","unstructured":"Vatter, V.: Finding regular insertion encodings for permutation classes. J. Symb. Comput. 47, 259\u2013265 (2012)","journal-title":"J. Symb. Comput."},{"key":"353_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","volume":"146","author":"J West","year":"1995","unstructured":"West, J.: Generating trees and the Catalan and Schr\u00f6der numbers. Discrete Math. 146, 247\u2013262 (1995)","journal-title":"Discrete Math."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0353-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-018-0353-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0353-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T21:36:28Z","timestamp":1604525788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-018-0353-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["353"],"URL":"https:\/\/doi.org\/10.1007\/s11786-018-0353-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"4 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}