{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:20Z","timestamp":1740109280497,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00453-019-00586-5","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:02:35Z","timestamp":1560243755000},"page":"616-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9680-2790","authenticated-orcid":false,"given":"Svante","family":"Janson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"586_CR1","unstructured":"Bassino, F., Bouvel, M., F\u00e9ray, V., Gerin, L., Maazoun, M., Pierrot, A.: Universal limits of substitution-closed permutation classes. Preprint (2017). \narXiv:1706.08333"},{"issue":"4","key":"586_CR2","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1214\/17-AOP1223","volume":"46","author":"Fr\u00e9d\u00e9rique Bassino","year":"2018","unstructured":"Bassino, F., Bouvel, M., F\u00e9ray, V., Gerin, L., Pierrot, A.: The Brownian limit of separable permutations. Ann. Probab. 46(4), 2134\u20132189 (2018)","journal-title":"The Annals of Probability"},{"key":"586_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/9780203494370","volume-title":"Combinatorics of Permutations","author":"M B\u00f3na","year":"2004","unstructured":"B\u00f3na, M.: Combinatorics of Permutations. Chapman & Hall\/CRC, Boca Raton, FL (2004)"},{"key":"586_CR4","unstructured":"B\u00f3na, M.: The copies of any permutation pattern are asymptotically normal. Preprint (2007). \narXiv:0712.2792"},{"issue":"2","key":"586_CR5","first-page":"89","volume":"12","author":"M B\u00f3na","year":"2010","unstructured":"B\u00f3na, M.: The absence of a pattern and the occurrences of another. Discrete Math. Theor. Comput. Sci. 12(2), 89\u2013102 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"586_CR6","series-title":"London Mathematical Society Lecture Notes Series","first-page":"89","volume-title":"On three Different Notions of Monotone Subsequences. Permutation Patterns","author":"M B\u00f3na","year":"2010","unstructured":"B\u00f3na, M.: On three Different Notions of Monotone Subsequences. Permutation Patterns. London Mathematical Society Lecture Notes Series, vol. 376, pp. 89\u2013114. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"586_CR7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.37236\/2060","volume":"19","author":"M B\u00f3na","year":"2012","unstructured":"B\u00f3na, M.: Surprising symmetries in objects counted by Catalan numbers. Electron. J. Comb. 19(1), 62 (2012)","journal-title":"Electron. J. Comb."},{"key":"586_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-2196-8","volume-title":"Advanced Combinatorics","author":"L Comtet","year":"1974","unstructured":"Comtet, L.: Advanced Combinatorics. Reidel, Dordrecht (1974)"},{"key":"586_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1214\/aoms\/1177730196","volume":"19","author":"W Hoeffding","year":"1948","unstructured":"Hoeffding, W.: A class of statistics with asymptotically normal distribution. Ann. Math. Stat. 19, 293\u2013325 (1948)","journal-title":"Ann. Math. Stat."},{"key":"586_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526169","volume-title":"Gaussian Hilbert Spaces","author":"S Janson","year":"1997","unstructured":"Janson, S.: Gaussian Hilbert Spaces. Cambridge University Press, Cambridge (1997)"},{"key":"586_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1214\/07-PS104","volume":"4","author":"S Janson","year":"2007","unstructured":"Janson, S.: Brownian excursion area, Wright\u2019s constants in graph enumeration, and other Brownian areas. Probab. Surv. 4, 80\u2013145 (2007)","journal-title":"Probab. Surv."},{"key":"586_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1017\/S0963548316000171","volume":"26","author":"S Janson","year":"2017","unstructured":"Janson, S.: Patterns in random permutations avoiding the pattern 132. Comb. Probab. Comput. 26, 24\u201351 (2017)","journal-title":"Comb. Probab. Comput."},{"key":"586_CR13","unstructured":"Janson, S.: Patterns in random permutations avoiding the pattern 321. Random Struct. Algor. (to appear)"},{"key":"586_CR14","first-page":"27","volume":"23","author":"S Janson","year":"2018","unstructured":"Janson, S.: Renewal theory for asymmetric $$U$$-statistics. Electron. J. Probab. 23, 27 (2018)","journal-title":"Electron. J. Probab."},{"issue":"1\u20132","key":"586_CR15","first-page":"117","volume":"6","author":"S Janson","year":"2015","unstructured":"Janson, S., Nakamura, B., Zeilberger, D.: On the asymptotic statistics of the number of occurrences of multiple permutation patterns. J. Comb. 6(1\u20132), 117\u2013143 (2015)","journal-title":"J. Comb."},{"key":"586_CR16","series-title":"Fundamental Algorithms","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. 1, 3rd edn. Addison-Wesley, Reading (1997)","edition":"3"},{"key":"586_CR17","unstructured":"Olver, F.W.J., Lozier, D. W., Boisvert, R.F., Clark, C.W. (ed.): NIST Handbook of Mathematical Functions Cambridge Univ. Press, Cambridge (Also available as NIST Digital Library of Mathematical Functions) (2010). \nhttp:\/\/dlmf.nist.gov\/\n\n. Accessed 17 Apr 2018"},{"key":"586_CR18","doi-asserted-by":"crossref","first-page":"38","DOI":"10.37236\/1470","volume":"6","author":"A Robertson","year":"1999","unstructured":"Robertson, A., Wilf, H.S., Zeilberger, D.: Permutation patterns and continued fractions. Electron. J. Comb. 6, 38 (1999)","journal-title":"Electron. J. Comb."},{"key":"586_CR19","unstructured":"Sloane, N.J.A. (ed.): The On-Line Encyclopedia of Integer Sequences. \nhttps:\/\/oeis.org\n\n. Accessed 17 Apr 2018"},{"issue":"4","key":"586_CR20","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(4), 383\u2013406 (1985)","journal-title":"Eur. J. Comb."},{"key":"586_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)"},{"issue":"1\u20133","key":"586_CR22","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(1\u20133), 247\u2013262 (1995)","journal-title":"Discrete Math."},{"issue":"10","key":"586_CR23","first-page":"3","volume":"14","author":"AFY Zhao","year":"2014","unstructured":"Zhao, A.F.Y.: Pattern popularity in multiply restricted permutations. J. Integer Seq. 14(10), 3 (2014)","journal-title":"J. Integer Seq."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00586-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00586-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00586-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T23:12:25Z","timestamp":1591744345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00586-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00586-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"24 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}