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
Parents
176
Pole assignment via Sylvester's equation
S.P. Bhattacharyya, Eurice de Souza · Systems & Control Letters · 1982 · 204 citations
A new solution to the generalized Sylvester matrix equation
Bin Zhou, Guang‐Ren Duan · Systems & Control Letters · 2005 · 173 citations
1–5 of 176
284
4
h-index
4
h-index
4
h-index
National and Kapodistrian University of Athens, Greece
4 publications · 55 citations
4
h-index
4
h-index
1–5 of 284
187
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
7 publications
100 citations

Harbin Institute of Technology
Harbin, China
5 h-index
11 publications
697 citations
Universidad de Buenos Aires
Buenos Aires, Argentina
4 h-index
5 publications
70 citations
North Carolina State University
Raleigh, United States
4 h-index
6 publications
95 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
6 publications
131 citations
Fundación Ciencias Exactas y Naturales
Buenos Aires, Argentina
4 h-index
5 publications
70 citations
Universitat de Barcelona
Barcelona, Spain
3 h-index
3 publications
48 citations

National and Kapodistrian University of Athens
Athens, Greece
3 h-index
4 publications
65 citations
1–8 of 187
9 publications · 556 citations
9
h-index
9 publications · 398 citations
9
h-index
8 publications · 222 citations
8
h-index
6 publications · 152 citations
6
h-index
5 publications · 562 citations
5
h-index
1–5