2000 character limit reached
Euler's partition theorem for all moduli and new companions to Rogers-Ramanujan-Andrews-Gordon identities
Published 26 Jul 2016 in math.CO | (1607.07583v2)
Abstract: In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related generating function if the moduli is three. We provide new companions to Rogers-Ramanujan-Andrews-Gordon identities under this conjecture.
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.