科研之友
微信
新浪微博
Facebook
分享链接
摘要
The Hilbert series (F) over tilde (mu) of the Garsia-Haiman module M-mu can be described combinatorially as the generating function of certain fillings of the Ferrers diagram of mu where mu is an integer partition of n. Since there are n! fillings that generate (F) over tilde (mu), it is desirable to find recursions to reduce the number of fillings that need to be considered when computing (F) over tilde (mu) combinatorially. In this paper, we present a combinatorial recursion for the case where mu is an n by 3 rectangle. This allows us to reduce the number of fillings under consideration from (3n)! to (3n)!/(3!(n)n!).
- 出版日期2013-1
