## Search

### Seminar View

FIELD Math: CMC August 20 (Tue), 2019 11:00-12:00 8309 Dongsu Kim Park, Kyewon Koh KAIST A combinatorial bijection on $k$-noncrossing partitions This talk is meant to give a combinatorial experience to noncombinatorialists. For any integer $k\geq2$, we prove combinatorially the following transformation identity $$\NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t),$$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the enumerative polynomial on partitions of $\{1,\ldots,m\}$ avoiding $k$-crossings (resp.~enhanced $k$-crossings) by number of blocks.It is based on my preprint (arXiv:1905.10526) with Zhicong Lin.

~