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

Authors

1.7K

  1. JT
    Jean‐Yves Thibon

    Laboratoire d'Informatique Gaspard-Monge, France

    19 publications · 1.5K citations

    16

    h-index

  2. TW
    Thomas W. Cusick

    University at Buffalo, State University of New York, United States

    13 publications · 311 citations

    12

    h-index

  3. JB
    Jeffrey B. Remmel

    University of California San Diego, United States

    13 publications · 680 citations

    12

    h-index

  4. JN
    Jean-Christophe Novelli

    Laboratoire d'Informatique Gaspard-Monge, France

    11 publications · 339 citations

    11

    h-index

  5. SM
    Subhamoy Maitra

    Indian Statistical Institute, India

    11 publications · 873 citations

    11

    h-index

1–5 of 1.7K

Venues

  1. IEEE Transactions on Information Theory

    31 publications · 1.6K citations

    24

    h-index

  2. Advances in Mathematics

    36 publications · 2.6K citations

    23

    h-index

  3. arXiv (Cornell University)

    Repository · 42 publications · 1.2K citations

    19

    h-index

  4. Journal of Combinatorial Theory Series A

    31 publications · 1.4K citations

    18

    h-index

  5. Discrete Mathematics

    21 publications · 990 citations

    16

    h-index

1–5