A Unification of Two Refinements of Euler's Partition Theorem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, 3 figures, the last version, to appear in The Ramanujan Journal

Keywords

Combinatorics, Number Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/221266

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0812.2826
 http://arxiv.org/abs/0812.2826

Collections

arXiv