Symmetric Functions
Symmetric Functions is a foundational algebraic construct in enumerative and bijective combinatorics, invariant theory, and algebraic combinatorics that consists of formal power series in infinitely many variables which are invariant under permutations of the variables and satisfy specific grading and symmetry conditions, thus enabling the study of combinatorial structures, representation theory, and symmetric polynomials in a unified framework.
1.3K
Publications
95.6K
Citations
1.7K
Authors
812
Institutions
Publications per year
2017–2026
161
1.7K
16
h-index
University at Buffalo, State University of New York, United States
13 publications · 311 citations
12
h-index
12
h-index
Laboratoire d'Informatique Gaspard-Monge, France
11 publications · 339 citations
11
h-index
11
h-index
1–5 of 1.7K
812
Massachusetts Institute of Technology
Cambridge, United States
21 h-index
43 publications
2.5K citations
University of California San Diego
San Diego, United States
18 h-index
43 publications
1.9K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
29 publications
933 citations

York University
Toronto, Canada
16 h-index
37 publications
1.6K citations
Laboratoire d'Informatique Gaspard-Monge
Champs-sur-Marne, France
16 h-index
32 publications
1.9K citations
University of Wisconsin–Madison
Madison, United States
14 h-index
23 publications
643 citations

University of Waterloo
Waterloo, Canada
14 h-index
26 publications
2.1K citations
University of Michigan
Ann Arbor, United States
14 h-index
17 publications
486 citations
1–8 of 812
31 publications · 1.6K citations
24
h-index
36 publications · 2.6K citations
23
h-index
Repository · 42 publications · 1.2K citations
19
h-index
31 publications · 1.4K citations
18
h-index
21 publications · 990 citations
16
h-index
1–5