A combinatorial proof of Andrews’ partition functions related to Schur’s partition theorem

DOI10.1090/S0002-9939-02-06560-7zbMath0989.05008OpenAlexW1894945851MaRDI QIDQ4529667

Ae Ja Yee

Publication date: 6 May 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-02-06560-7

zbMATH Keywords

partition functionsSchur's second partition theorem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (4)

A unification of two refinements of Euler's partition theorem ⋮ Linked partition ideals and a Schur-type identity of Andrews ⋮ A bijective toolkit for signed partitions ⋮ On generalized Schur’s partitions

Cites Work

• Unnamed Item

This page was built for publication: A combinatorial proof of Andrews’ partition functions related to Schur’s partition theorem