Sylvester's Theorem

Sylvester's Theorem is a fundamental result in the theory of integer partitions that asserts the number of partitions of a positive integer \( n \) into distinct parts is equal to the number of partitions of \( n \) into odd parts, thereby establishing a combinatorial bijection between these two distinct classes of partition.

176

Publications

5.9K

Citations

284

Authors

187

Institutions

Publications per year

2017–2026

22

Variants

Sylvester's Partition Theorem

Authors

284

  1. ÁS
    Ágnes Szántó

    North Carolina State University, United States

    4 publications · 59 citations

    4

    h-index

  2. CD
    Carlos D’Andrea

    Universitat de Barcelona, Spain

    4 publications · 62 citations

    4

    h-index

  3. TK
    Takao Komatsu

    Hirosaki University, Japan

    4 publications · 77 citations

    4

    h-index

  4. IZ
    Ioannis Z. Emiris

    National and Kapodistrian University of Athens, Greece

    4 publications · 55 citations

    4

    h-index

  5. TK
    Térésa Krick

    Universidad de Buenos Aires, Argentina

    4 publications · 59 citations

    4

    h-index

1–5 of 284

Venues

  1. Linear Algebra and its Applications

    9 publications · 556 citations

    9

    h-index

  2. American Mathematical Monthly

    9 publications · 398 citations

    9

    h-index

  3. Journal of Symbolic Computation

    8 publications · 222 citations

    8

    h-index

  4. Mathematics Magazine

    6 publications · 152 citations

    6

    h-index

  5. Systems & Control Letters

    5 publications · 562 citations

    5

    h-index

1–5