2000 character limit reached
Even-Odd partition identities of Rogers-Ramanujan type
Published 21 Jul 2020 in math.AG and math.CO | (2007.10881v4)
Abstract: We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of Rogers-Ramanujan type.
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.