Speaker
Heesung Shin
(Inha University)
Description
A sequence $(e_1, e_2, \cdots, e_n)$ is an inversion sequences if $0\leq e_i < i$ for all $i=1, \ldots, n$. We say that an inversion sequences $e=(e_1, e_2, \cdots, e_n)$ \emph{contains} the pattern $102$ if there exist some indices $i < j < k$ such that $e_j < e_i < e_k$. Otherwise, $e$ is said to \emph{avoid} the pattern $102$.
In this talk, we will construct a correspondence between the set of 2-Schröder paths without peaks and valleys ending with a diagonal step and the set of $102$-avoiding inversion sequences.
This is the joint work with JiSun Huh, Sangwook Kim, and Seunghyun Seo.
Primary authors
JiSun Huh
(Ajou University)
Sangwook Kim
(Chonnam National University)
Seunghyun Seo
(Kangwon National University)
Heesung Shin
(Inha University)
