Jae-Seong Oh
Sungkyunkwan University · 数学
研究室紹介
Professor Jae-Seong Oh's research lies at the intersection of algebraic combinatorics, representation theory, and symmetric function theory. His work centers on combinatorial structures such as web permutations, chromatic symmetric functions, and Macdonald polynomials, with a focus on providing positive combinatorial formulas and understanding transition matrices between canonical bases. He investigates deep connections to representation theory of symmetric groups, elliptic Hall algebras, and link homology, particularly through the lens of parking functions and cyclic sieving phenomena. His recent work also extends to rational analogues of classical combinatorial involutions and q-analogues in rook theory.
Research Overview
Research Output Trend
Figures are computed from collected data and may differ slightly.
Selected Papers
15Abstract We introduce a new class of permutations, called web permutations. Using these permutations, we provide a combinatorial interpretation for entries of the transition matrix between the Specht and $\operatorname {SL}_2$ -web bases of the irreducible $ \mathfrak {S}_{2n} $ -representation indexed by $ (n,n) $ , which answers Rhoades’s question. Furthermore, we study enumerative properties of these permutations.
We introduce a new class of permutations, called web permutations. Using these permutations, we provide a combinatorial interpretation for entries of the transition matrix between the Specht and web bases, which answers Rhoades's question. Furthermore, we study enumerative properties of these permutations.
Abstract In this paper, we introduce the $\alpha $-chromatic symmetric functions $\chi ^{(\alpha )}_\pi [X;q]$, extending Shareshian and Wachs’ chromatic symmetric functions with an additional real parameter $\alpha $. We present positive combinatorial formulas with explicit interpretations. Notably, we show an explicit monomial expansion in terms of the $\alpha $-binomial basis and an expansion into certain chromatic symmetric functions in terms of the $\alpha $-falling factorial basis. Among v
The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration o
We prove that the symmetric function $e_{(1^k)}[-MX^{m,n}] \cdot 1$, arising from the elliptic Hall algebra, equals the generating function for $k$-tuples of cyclic $(m,n)$-parking functions. This result resolves a conjecture of Gorsky--Mazin--Vazirani and Wilson, establishing that the elliptic Hall algebra governs the Khovanov--Rozansky homology of torus links $T(km,kn)$. Consequently, this provides an affirmative answer to a question of Galashin and Lam in the torus link case. As a key step in
Abstract The celebrated Haglund–Haiman–Loehr (HHL) formula provides an explicit monomial expansion of the Macdonald polynomials. In 1994, Butler introduced a refinement of the Macdonald polynomial and conjectured its Schur positivity. According to the Science Fiction conjecture by Bergeron and Garsia, this refinement represents the “intersection” of Macdonald polynomials. In this work, we introduce a novel combinatorial tool, the column exchange rule , which enables us to derive a positive monom
We prove that the symmetric function $e_{(1^k)}[-MX^{m,n}] \cdot 1$, arising from the elliptic Hall algebra, equals the generating function for $k$-tuples of cyclic $(m,n)$-parking functions. This result resolves a conjecture of Gorsky--Mazin--Vazirani and Wilson, establishing that the elliptic Hall algebra governs the Khovanov--Rozansky homology of torus links $T(km,kn)$. Consequently, this provides an affirmative answer to a question of Galashin and Lam in the torus link case. As a key step in
We define the acyclic orientation polynomial of a graph to be the generating function for the sinks of its acyclic orientations. Stanley proved that the number of acyclic orientations is equal to the chromatic polynomial evaluated at $-1$ up to sign. Motivated by this link between acyclic orientations and the chromatic polynomial, we develop "acyclic orientation" analogues of theorems concerning the chromatic polynomial of Birkhoff, Whitney, and Greene-Zaslavsky. As an application, we provide a
In this paper, we introduce the \emph{$α$-chromatic symmetric functions} $χ^{(α)}_π[X;q]$, extending Shareshian and Wachs' chromatic symmetric functions with an additional real parameter $α$. We present positive combinatorial formulas with explicit interpretations. Notably, we show an explicit monomial expansion in terms of the $α$-binomial basis and an expansion into certain chromatic symmetric functions in terms of the $α$-falling factorial basis. Among various connections with other subjects,
Abstract Let be a matrix of variables and let be the polynomial ring in these variables. Given two weak compositions of lengths and , we study the ideal generated by row sums, column sums, monomials in row of degree , and monomials in column of degree . We prove results connecting algebraic properties of the quotient ring with the set of ‐contingency tables. The standard monomial basis of with respect to a diagonal term order is encoded by the matrix‐ball avatar of the Robinson–Schensted–Knuth c