Department of Mathematics, Sungkyunkwan University, Suwon

## Posts Tagged ‘김장수’

### [Colloquium] Jang Soo Kim, Combinatorics of orthogonal polynomials

Wednesday, March 25th, 2015Department of Mathematics, Sungkyunkwan University, Suwon

### 2014 KAIST CMC Discrete Math Workshop

Sunday, November 23rd, 2014Preregistration in kcw2014.eventbrite.com deadline: Dec. 5 (Friday)

- 1:30-2:00 Registration
- 2:00-2:30 Young Soo Kwon (권영수), Yeungnam University: A variation of list coloring and its properties
- 2:40-3:10 Mitsugu Hirasaka, Pusan National University: Small topics on association schemes
- 3:10-3:40 Coffee Break
- 3:40-4:10 Younjin Kim (김연진), KAIST: On Extremal Combinatorial Problems of Noga Alon
- 4:20-4:50 Jang Soo Kim (김장수), Sungkyunkwan University: A new q-Selberg integral, Schur functions, and Young books
- 5:00-6:00 Discussion
- 6:00- Dinner

- 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University (Room 1501) :
- 12:00-1:30 Lunch
- 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University (Room 1501) :
- 3:00-3:40 Coffee Break
- 3:40-4:10 Suyoung Choi (최수영), Ajou University (Room 3435): T.B.A.
- 4:20-4:50 Jaehoon Kim (김재훈), University of Birmingham (Room 3435): Regular subgraphs in uniform hypergraphs
- 5:00-5:30 Ilkyoo Choi (최일규), KAIST (Room 3435): On choosability with separation of planar graphs with forbidden cycles
- 6:00- Banquet

- 10:30-12:00 CMC Intensive Lecture (Paul Seymour), Princeton University :
- 12:00-1:30 Lunch
- 1:30-3:00 CMC Intensive Lecture (Maria Chudnovsky), Columbia University :
- 3:00-3:30 Coffee Break
- 3:30-4:30 Petr Hliněný, Masaryk University: Planar graph emulators – Beyond planarity in the plane
- 4:45-5:45 Discussion
- 6:00- Dinner

### Jang Soo Kim (김장수), Combinatorics of continued fractions and its application to Jacobi’s triple product identity

Wednesday, September 4th, 2013KIAS

ROOM 1409

### Jang Soo Kim (김장수), Proofs of Two Conjectures of Kenyon and Wilson on Dyck Tilings

Tuesday, June 26th, 2012School of Mathematics, University of Minnesota, Minneapolis, MN, USA

*Fri*4PM-5PM

^{-1}is equal to the number of certain Dyck tilings of a skew shape. They conjectured two formulas on the sum of the absolute values of the entries in a row or a column of M

^{-1}. In this talk we prove the two conjectures. As a consequence we obtain that the sum of the absolute values of all entries of M

^{-1}is equal to the number of complete matchings. We also find a bijection between Dyck tilings and complete matchings.

This talk is based on the following paper: arxiv:1108.5558.

### Jang Soo Kim (김장수), Combinatorics on permutation tableaux

Friday, April 16th, 2010Laboratoire d’Informatique Algorithmique: Fondements et Applications (LIAFA), University of Paris 7, France

A permutation tableau is a relatively new combinatorial object introduced by Postnikov in his study of totally nonnegative Grassmanian. As one can guess from its name, permutation tableaux are in bijection with permutations. Surprisingly, there is also a connection between permutation tableaux and a statistical physics model called PASEP (partially asymmetric exclusion process). In this talk, we study some combinatorial properties of permutation tableaux. One of our result is a sign-imbalace formula for permutation tableaux which is very similar to the sign-imbalace formula for standard Young tableaux conjectured by Stanley.