2000 character limit reached
Euler's partition theorem for all moduli and new companions to Rogers-Ramanujan-Andrews-Gordon identities
Published 11 Aug 2016 in math.CO | (1608.03635v2)
Abstract: We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.
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.