2000 character limit reached
New infinite hierarchies of polynomial identities related to the Capparelli partition theorems
Published 17 Jun 2021 in math.NT and math.CO | (2106.09773v2)
Abstract: We prove a new polynomial refinement of the Capparelli's identities. Using a special case of Bailey's lemma we prove many infinite families of sum-product identities that root from our finite analogues of Capparelli's identities. We also discuss the $q\mapsto 1/q$ duality transformation of the base identities and some related partition theoretic relations.
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.