2000 character limit reached
A generalisation of a partition theorem of Andrews to overpartitions
Published 1 May 2014 in math.CO and math.NT | (1405.0255v1)
Abstract: In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and recurrences.
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.