A combinatorial proof of a refinement of the Andrews-Olsson partition identity

DOI10.1016/S0195-6698(13)80109-6zbMath0743.05003MaRDI QIDQ1178030

Christine Bessenrodt

Publication date: 26 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\(L\)-hooksAndrews-Olsson partitionYoung modular diagram

Mathematics Subject Classification ID

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

Related Items (13)

An iterative-bijective approach to generalizations of Schur's theorem ⋮ Generalisations of the Andrews-Olsson partition identity and applications ⋮ Crystal bases of the Fock space representations and string functions ⋮ On self-Mullineux and self-conjugate partitions ⋮ On residue symbols and the Mullineux conjecture ⋮ A unification of two refinements of Euler's partition theorem ⋮ A polynomial identity implying Schur’s partition theorem ⋮ In memoriam: Christine Bessenrodt (1958--2022) ⋮ The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls ⋮ On generalizations of partition theorems of Schur and Andrews to overpartitions ⋮ A generalisation of a second partition theorem of Andrews to overpartitions ⋮ The dual of Göllnitz's (big) partition theorem ⋮ Generalizations of Schur's partition theorem

Cites Work

• Bijections of p -Regular Partitions and p -Modular Irreducibles of the Symmetric Groups
• On the p -Cores of p -Regular Diagrams
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial proof of a refinement of the Andrews-Olsson partition identity