2000 character limit reached
Andrews-Gordon Type Series for Kanade-Russell Conjectures
Published 4 Aug 2018 in math.CO | (1808.01432v1)
Abstract: We construct Andrews-Gordon type evidently positive series as generating functions of partitions satisfying certain difference conditions in six conjectures by Kanade and Russell. We construct generating functions for missing partition enumerants, naturally without claiming new partition identities. Thus, we obtain $q$-series conjectures as companions to Kanade and Russell's combinatorial conjectures.
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.