Seunghyun Seo

Department of Mathematics Education

Kangwon National University

1 KNU-Ave, Chuncheon, 24341, Korea

Tel: +82-33-250-6721

Fax: +82-33-259-5599

E-mail: shyunseo (AT) kangwon.ac.kr

Teaching: 2017 spring

  • Topology 1
  • Topics in algebra
  • Combinatorics and Graph Theory

Research Area

Education

  • 2004, Ph. D. Dept. of Mathematics, KAIST (advisor: Dongsu Kim)
  • 1998, M. S. Dept. of Mathematics, KAIST
  • 1996, B. S. Dept. of Mathematics Education, Seoul National University

Visiting Position

  • 2004-2005, Visiting Scholar, Department of Mathematics, Brandeis University (mentor: Ira Gessel)
  • 2016-2017, Visiting Scholar, Department of Mathematics, The Pennsylvania State University (mentor: Ae Ja Yee)

Employment

  • 2012-present, Associate Professor, Department of Mathematics Education, Kangwon National University
  • 2008-2012, Assistant Professor, Department of Mathematics Education, Kangwon National University
  • 2007-2008, Lecturer, Department of Mathematics Education, Cheongju University
  • 2005-2007, Instructor, Department of Mathematics, Seoul National University

Publications

  1. The Catalan Threshold Arrangement, Journal of Integer Sequences 20(1) (2017), Article 17.1.1.
  2. Combinatorial Enumeration of the Regions of Some Linear Arrangements, Bulletin of Korean Mathematical Society 53(5) (2016), 1281-1289.
  3. Signed a-polynomials of graphs and Poincaré polynomials of real toric manifolds (with Heesung Shin), Bulletin of Korean Mathematical Society 52(2) (2015), 467-481.
  4. Annular noncrossing permutations and minimal transitive factorizations (with Jang Soo Kim and Heesung Shin), Journal of Combinatorial Theory, series A 124(2014), 251-262.
  5. Shi-threshold arrangements, Electronic Journal of Combinatorics 19(3) (2012), P39.
  6. Enumeration of 0/1-matrices avoiding some 2x2 matrices (with Hyeong-Kwan Ju), Discrete Mathematics312(16) (2012), 2473-2481.
  7. A refinement for ordered labeled trees (with Heesung Shin), Korean Journal of Mathematics 20(2) (2012), 255-261.
  8. On the enumeration of rooted trees with fixed size of maximal decreasing trees (with Heesung Shin), Discrete Mathematics 312(2) (2012), 419-426.
  9. Combinatorial proofs of inverse relations and log-concavity for Bessel numbers (with Hyuk Han), European Journal of Combinatorics 29(2008), 1544-1554.
  10. A Generalized enumeration of labeled trees and reverse Prüfer algorithm (with Heesung Shin), Journal of Combinatorial Theory, series A 114 (2007), 1357-1361.
  11. An efficient top-down search algorithm for learning Boolean networks of gene expression (with Dougu Nam, Sangsoo Kim), Machine Learning 65(1) (2006), 229-245.
  12. A refinement of Cayley's formula for trees (with Ira Gessel), Electronic Journal of Combinatorics 11(2) (2006), R27.
  13. A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees, Electronic Journal of Combinatorics 11(2) (2005), N3.
  14. Colored Prüfer codes for k-edge colored trees (with Manwon Cho et al), Electronic Journal of Combinatorics 11(1) (2004), N10.
  15. Transitive cycle factorizations and prime parking functions (with Dongsu Kim), Journal of Combinatorial Theory, series A 104 (2003), 125-135.