2000 character limit reached
On two-color partitions with odd smallest part
Published 18 Oct 2024 in math.NT | (2410.14190v1)
Abstract: We will consider two-color integer partitions in which the smallest part is odd and the odd or the even parts may occur only in one color. It turns out that these partitions are generated by the mock theta functions of third order due to Ramanujan and Watson. Motivated by this, we will also consider two-color partitions in which the parts of the same parity may occur in both colors.
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.