2000 character limit reached
(q,t)-hook formula for Birds and Banners
Published 8 Feb 2013 in math.CO | (1302.1968v1)
Abstract: We study Okada's conjecture on $(q,t)$-hook formula of general $d$-complete posets. Proctor classified $d$-complete posets into 15 irreducible ones. We try to give a case-by-case proof of Okada's $(q,t)$-hook formula conjecture using the symmetric functions. Here we give a proof of the conjecture for birds and banners, in which we use Gasper's identity for VWP-series ${}{12}W{11}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.