2000 character limit reached
Generalizations of Euler's Theorem to $k$-regular partitions
Published 18 Nov 2025 in math.CO | (2511.14594v1)
Abstract: Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $# A_k(n) = # B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition theorem. In this paper, we present a new partition set $E_k(n)$, which is equinumerous to $B_k(n)$.
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.