1 citations · 1 across the 1 of their papers we have counts for
6 papers
A combinatorial model for the transition matrix between the Specht and web bases
Byung-Hak Hwang, Jihyeug Jang, Jaeseong Oh
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…
Macdonald polynomials and cyclic sieving
Jaeseong Oh
The Garsia--Haiman module is a bigraded -module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an -set …
Cyclic sieving and orbit harmonics
Jaeseong Oh, Brendon Rhoades
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group on a finite set to a graded action of on a polyn…
On linearization coefficients of -Laguerre polynomials
Byung-Hak Hwang, Jang Soo Kim, Jaeseong Oh +1
The linearization coefficient of classical Laguerre polynomials is known to be equal to the number of -derangeme…
A 2-isomorphism theorem for delta-matroids
Iain Moffatt, Jaeseong Oh
Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterisi…
Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
Byung-Hak Hwang, Woo-Seok Jung, Kang-Ju Lee +2
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 orientati…