Generalisations of the Andrews-Olsson partition identity and applications

DOI10.1016/0012-365X(93)E0189-BMaRDI QIDQ1894754zbMATH OpenFDO

Authors Christine Bessenrodt

Publication date 5 June 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)E0189-B

zbMATH Keywords

Andrews-Olsson partition identitynumber of partitionsSchur partition theoremSylvester bijection

Mathematics Subject Classification ID

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

Review text

The celebrated 1926 partition theorem of Schur is the statement that the number of partitions of \(n\) into distinct parts \(\equiv 1\) or \(2\pmod 3\) is equal to the number of partitions of \(n\) into parts differing by \(\geq 3\) and where consecutive multiples of 3 cannot occur as parts. In the 1960's, George Andrews obtained an extension of this result where the modulus 3 is replaced by an integer \(M\geq 3\) and the residue classes \(1, 2\pmod 3\) are replaced by \(r_i\pmod M\) where the \(r_i\) satisfy certain conditions. In 1991, \textit{G. E. Andrews} and \textit{J. B. Olsson} [J. Reine Angew. Math. 413, 198-212 (1991; Zbl 0704.20003)] obtained an important reformulation of this general result by using conjugation of Ferrers graphs. Also in 1991, the author [Eur. J. Comb. 12, No. 4, 271-276 (1991; Zbl 0743.05003)] gave a combinatorial proof of the Andrews-Olsson partition identity. In this paper the author obtains a further generalization by removing the conditions on the residues \(r_i\pmod M\) that Andrews and Olsson had. In doing so, the author obtains as a special case, a generalization of the Schur partition theorem due to the reviewer and \textit{B. Gordon} [Manuscr. Math. 79, No. 2, 113-126 (1993; Zbl 0799.11043)].

Recommendations

• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• Schur's Partition Theorem, Companions, Refinements and Generalizations
• A generalisation of two partition theorems of Andrews
• A generalisation of a partition theorem of Andrews
• On generalizations of partition theorems of Schur and Andrews to overpartitions

Cites work

• A bijection for Lebesgue's partition identity in the spirit of Sylvester
• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• A Combinatorial Proof of Schur's 1926 Partition Theorem
• Generalizations of Schur's partition theorem
• scientific article; zbMATH DE number 4154697 (Why is no real title available?)
• scientific article; zbMATH DE number 3760259 (Why is no real title available?)
• On the Geometry of Numbers in Elementary Number Theory

Cited in

(11)

• A combinatorial proof of a refinement of the Andrews-Olsson partition identity
• Generalizations of Schur's partition theorem
• Andrews-Gordon type series for Schur's partition identity
• An iterative-bijective approach to generalizations of Schur's theorem
• A generalisation of a partition theorem of Andrews
• Bressoud's generalization of Schur's theorem extension to overpartitions
• scientific article; zbMATH DE number 7399930 (Why is no real title available?)
• The Andrews-Olsson identity and Bessenrodt insertion algorithm on Young walls
• Extensions and variations of Andrews-Merca identities
• A unification of two refinements of Euler's partition theorem
• Generating functions for fixed points of the Mullineux map

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894754)