{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:05Z","timestamp":1753893845549,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A permutation $\\pi$ avoids the simsun pattern $\\tau$ if $\\pi$ avoids the consecutive pattern $\\tau$ and the same condition applies to\u00a0 the restriction of $\\pi$ to any interval $[k].$ Permutations avoiding the simsun pattern $321$ are the usual simsun permutation introduced by Simion and Sundaram. Deutsch and Elizalde enumerated the set of simsun permutations that avoid in addition any set of patterns of length $3$ in the classical sense. In this paper we enumerate the set of permutations avoiding any other simsun pattern of length $3$ together with any set of classical patterns of length $3.$ The main tool in the proofs is a massive use of a bijection between permutations and increasing binary trees.<\/jats:p>","DOI":"10.37236\/9482","type":"journal-article","created":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T02:46:58Z","timestamp":1599187618000},"source":"Crossref","is-referenced-by-count":1,"title":["Permutations Avoiding a Simsun Pattern"],"prefix":"10.37236","volume":"27","author":[{"given":"Marilena","family":"Barnabei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Flavio","family":"Bonetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niccol\u00f2","family":"Castronuovo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Silimbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,9,4]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p45\/8163","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i3p45\/8163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T02:46:58Z","timestamp":1599187618000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i3p45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,4]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,7,9]]}},"URL":"https:\/\/doi.org\/10.37236\/9482","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,9,4]]},"article-number":"P3.45"}}