KCL2025.11
KAIST Combinatorics Lab. Workshop
KAIST Combinatorics Lab. Workshop
It is a triannual (three-times-a-year) seminar organized by academic genealogy from Professor Dongsu Kim in KAIST Combinatorics Laboratory, which KCL stands for. The aim of this seminar is to bring together active combinatorialists to discuss recent and prospective advances in algebraic and enumerative combinatorics and related areas. The style of talk tends to be less formal.
Title KAIST Combinatorics Lab. Workshop 2025.11 (KCL2025.11)
Date November 21-22 (Friday-Saturday), 2025
Venue Room 205, Building 210 (사범대학 교육1호관), Kangwon National University, Chuncheon
November 21 (Friday)
13:30 - 14:00 Registration
14:00 - 15:00 Invited Talk
Speaker Sangwook Kim
Abstract An inversion sequence is an integer sequence e=(e1, e2, ... , en) satisfying 0 ≤ ei < i for each i. The study of pattern avoidance in inversion sequences was initiated independently by Corteel et al., and Mansour and Shattuck. In this talk, we provide a brief introduction and survey the enumeration of inversion sequences avoiding one or two patterns of length 3. We also provide some recent results about 102-avoiding inversion sequences.
15:00 - 15:30 Coffee Break
15:30 - 16:05 Slow Lightning Talks Part 1 (Up to 10 minutes each)
Dongsu Kim, An involution for a Catalan-tangent number identity
Minho Song, A class of pseudo-involutory series
Taehyun Eom, cddb : how it works
16:05 - 16:25 Break Time
16:25 - 17:00 Slow Lightning Talks Part 2 (Up to 10 minutes each)
JiSun Huh, I-boxes and Demazure weaves
Cheolwon Heo, Non-prime graphs with the minimum number of edges
Meesue Yoo, Schur coefficient computation of chromatic quasisymmetric functions over SYT's
17:00 - 17:30 Lightning Talks Part 3 (Open floor)
Introduction of attendees from Kangwon National University
17:30 - 18:00 Move to accommodation (더베네치아스위트)
18:00 - Dinner (중화루)
November 22 (Saturday)
08:00 - 09:30 Early Bird Excursion (공지천 유원지)
09:30 - 10:00 Reception (Coffee/Bread)
10:00 - 10:40 Lightning Talks Part 4 (Up to 10 minutes each)
Heesung Shin, Symbolic Computation on SymPy
Hojoon Lee, Meander problem and meandric permutations
Younggwang Cho, Topics of Research Interest
Jang Soo Kim, Combinatorics of rhombic alternative tableaux
10:40 - 11:00 Group Photo
11:00 - 12:00 Talk
Speaker Seunghyun Seo
Title Enumeration of (102,000)-avoiding inversion sequences
Abstract In this talk, we study (102,000)-avoiding inversion sequences with a fixed number of distinct elements. By introducing simple H-paths, we derive the trivariate generating function for these inversion sequences with respect to their length, number of distinct elements, and rank. As consequences, we obtain an explicit formula for the number of (102,000)-avoiding inversion sequences with fixed length and number of distinct elements and we also provide a formula for those with fixed number of distinct elements and rank. In particular, we show that the number of (102,000)-avoiding inversion sequences with a fixed number of distinct elements whose rank is zero are given by the 3-Fuss-Catalan numbers.
12:30 - 13:30 Lunch (우묵길 닭갈비)
Dongsu Kim, GIST
Seunghyun Seo, Kangwon National University
Heesung Shin, Inha University
Jang Soo Kim, Sungkyunkwan University
Hojoon Lee, Sungkyunkwan University
Younggwang Cho, Sungkyunkwan University
Taehyun Eom, GIST
Sangwook Kim, Invited Speaker, Chonnam National University
Meesue Yoo, Chungbuk National University
Minho Song, Sungkyunkwan University
JiSun Huh, University of Seoul
Cheolwon Heo, SUNY Korea
Seunghyun Seo, Kangwon National University