Generalisations of the Andrews-Olsson partition identity and applications

DOI10.1016/0012-365X(93)E0189-BzbMath0839.05009MaRDI QIDQ1894754

Christine Bessenrodt

Publication date: 5 June 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

number of partitionsAndrews-Olsson partition identitySchur partition theoremSylvester bijection

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Elementary theory of partitions (11P81)

Related Items (3)

An iterative-bijective approach to generalizations of Schur's theorem ⋮ A unification of two refinements of Euler's partition theorem ⋮ The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls

Cites Work

• Unnamed Item
• Unnamed Item
• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• Generalizations of Schur's partition theorem
• A bijection for Lebesgue's partition identity in the spirit of Sylvester
• A Combinatorial Proof of Schur's 1926 Partition Theorem
• On the Geometry of Numbers in Elementary Number Theory

This page was built for publication: Generalisations of the Andrews-Olsson partition identity and applications