{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T20:28:00Z","timestamp":1776198480489,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this article, we provide a bijection between the set of inversion sequences avoiding the pattern 102 and the set of 2-Schr\u00f6der paths having neither peaks nor valleys and ending with a diagonal step. To achieve this, we introduce two intermediate objects, called UVD paths and labeled $F$-paths, and establish bijections among all four families. For each of these combinatorial objects, we define a natural statistic and enumerate the corresponding structures with respect to this statistic. \u00a0In addition, we study inversion sequences avoiding 102 and another pattern of length 3, providing refined enumerations according to the same statistic.<\/jats:p>","DOI":"10.37236\/14296","type":"journal-article","created":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T19:28:43Z","timestamp":1776194923000},"source":"Crossref","is-referenced-by-count":0,"title":["On 102-Avoiding Inversion Sequences"],"prefix":"10.37236","volume":"33","author":[{"given":"JiSun","family":"Huh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangwook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seunghyun","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heesung","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2026,4,14]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p10\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i2p10\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T19:28:48Z","timestamp":1776194928000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i2p10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,14]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,4,14]]}},"URL":"https:\/\/doi.org\/10.37236\/14296","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,14]]},"article-number":"P2.10"}}