On Garsia-Remmel problem of rook equivalence
暂无分享,去创建一个
Abstract In 1987, Garsia and Remmel proved a theorem that two Ferrers boards share the same rook polynomial if and only if they share all the Garsia-Remmel q-rook polynomials. In their paper they proposed the problem to find a purely combinatorial proof to this theorem. This note gives such a proof.
[1] Kequan Ding. Invisible permutations and rook placements on a Ferrers board , 1995, Discret. Math..
[2] Jeffrey B. Remmel,et al. Q-counting rook configurations and a formula of frobenius , 1986, J. Comb. Theory A.
[3] John Riordan,et al. Introduction to Combinatorial Analysis , 1959 .
[4] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .