Integer Partitions
Integer Partition is a combinatorial object consisting of a finite sequence of positive integers arranged in non-increasing order whose sum equals a given positive integer, distinguished from other compositions by its lack of regard for order and restriction to descending arrangement.
496
Publications
19.3K
Citations
615
Authors
360
Institutions
Publications per year
2017–2026
44
496
1–5 of 496
615
20
h-index
10
h-index
10
h-index
10
h-index
9
h-index
1–5 of 615
360

Pennsylvania State University
State College, United States
27 h-index
46 publications
2K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
26 publications
706 citations

UNSW Sydney
Sydney, Australia
11 h-index
11 publications
349 citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
13 publications
548 citations

Tezpur University
Tezpur, India
9 h-index
17 publications
341 citations

Sorbonne Université
Paris, France
8 h-index
9 publications
254 citations
Université Claude Bernard Lyon 1
Villeurbanne, France
7 h-index
10 publications
237 citations

University of Minnesota
Minneapolis, United States
7 h-index
7 publications
1K citations
1–8 of 360
31 publications · 1.3K citations
19
h-index
25 publications · 546 citations
16
h-index
20 publications · 410 citations
15
h-index
TRAN · 16 publications · 675 citations
15
h-index
20 publications · 607 citations
14
h-index
1–5