A double bounded version of Schur's partition theorem

DOI10.1007/s004930200008zbMath0997.05006arXivmath/0006207OpenAlexW2068912818MaRDI QIDQ1848145

Krishnaswami Alladi, Alexander Berkovich

Publication date: 3 November 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0006207

zbMATH Keywords

partitionsSchur's theoremweighted words

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Elementary theory of partitions (11P81)

Related Items (3)

A polynomial identity implying Schur’s partition theorem ⋮ On double sum generating functions in connection with some classical partition theorems ⋮ A computer proof of a polynomial identity implying a partition theorem of Göllnitz

This page was built for publication: A double bounded version of Schur's partition theorem