A Unification of Two Refinements of Euler's Partition Theorem
classification
🧮 math.CO
math.NT
keywords
partitionbessenrodteulerrefinementstheoremunificationalgorithmandrews-olsson
read the original abstract
We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used in our combinatorial construction.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.