A refinement of the alladi–schur theorem

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

Abstract

K. Alladi first observed a variant of I. Schur’s 1926 partition theorem. Namely, the number of partitions of n in which all parts are odd and none appears more than twice equals the number of partitions of n in which all parts differ by at least 3 and more than 3 if one of the parts is a multiple of 3. In this paper, we refine this result to one that counts the number of parts in the relevant partitions.

Original languageEnglish (US)
Title of host publicationDevelopments in Mathematics
PublisherSpringer New York LLC
Pages71-77
Number of pages7
DOIs
StatePublished - Jan 1 2019

Publication series

NameDevelopments in Mathematics
Volume58
ISSN (Print)1389-2177

Fingerprint

Refinement
Partition
Theorem
Count
Odd

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Andrews, G. E. (2019). A refinement of the alladi–schur theorem. In Developments in Mathematics (pp. 71-77). (Developments in Mathematics; Vol. 58). Springer New York LLC. https://doi.org/10.1007/978-3-030-11102-1_5
Andrews, George E. / A refinement of the alladi–schur theorem. Developments in Mathematics. Springer New York LLC, 2019. pp. 71-77 (Developments in Mathematics).
@inbook{36a8afdadf6b425f847c394e495455ae,
title = "A refinement of the alladi–schur theorem",
abstract = "K. Alladi first observed a variant of I. Schur’s 1926 partition theorem. Namely, the number of partitions of n in which all parts are odd and none appears more than twice equals the number of partitions of n in which all parts differ by at least 3 and more than 3 if one of the parts is a multiple of 3. In this paper, we refine this result to one that counts the number of parts in the relevant partitions.",
author = "Andrews, {George E.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-11102-1_5",
language = "English (US)",
series = "Developments in Mathematics",
publisher = "Springer New York LLC",
pages = "71--77",
booktitle = "Developments in Mathematics",

}

Andrews, GE 2019, A refinement of the alladi–schur theorem. in Developments in Mathematics. Developments in Mathematics, vol. 58, Springer New York LLC, pp. 71-77. https://doi.org/10.1007/978-3-030-11102-1_5

A refinement of the alladi–schur theorem. / Andrews, George E.

Developments in Mathematics. Springer New York LLC, 2019. p. 71-77 (Developments in Mathematics; Vol. 58).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - A refinement of the alladi–schur theorem

AU - Andrews, George E.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - K. Alladi first observed a variant of I. Schur’s 1926 partition theorem. Namely, the number of partitions of n in which all parts are odd and none appears more than twice equals the number of partitions of n in which all parts differ by at least 3 and more than 3 if one of the parts is a multiple of 3. In this paper, we refine this result to one that counts the number of parts in the relevant partitions.

AB - K. Alladi first observed a variant of I. Schur’s 1926 partition theorem. Namely, the number of partitions of n in which all parts are odd and none appears more than twice equals the number of partitions of n in which all parts differ by at least 3 and more than 3 if one of the parts is a multiple of 3. In this paper, we refine this result to one that counts the number of parts in the relevant partitions.

UR - http://www.scopus.com/inward/record.url?scp=85062909430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062909430&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-11102-1_5

DO - 10.1007/978-3-030-11102-1_5

M3 - Chapter

AN - SCOPUS:85062909430

T3 - Developments in Mathematics

SP - 71

EP - 77

BT - Developments in Mathematics

PB - Springer New York LLC

ER -

Andrews GE. A refinement of the alladi–schur theorem. In Developments in Mathematics. Springer New York LLC. 2019. p. 71-77. (Developments in Mathematics). https://doi.org/10.1007/978-3-030-11102-1_5