Sum-product Phenomena

Sum–Product Phenomena is a theoretical framework in additive combinatorics that asserts, for a finite set of numbers, either the sumset or the product set must be significantly larger than the original set, reflecting the incompatibility of additive and multiplicative structure.

58

Publications

3.4K

Citations

79

Authors

71

Institutions

Publications per year

2017–2026

7

Variants

Sum-product Phenomenon

Authors

79

  1. ID
    Ilya D. Shkredov

    Steklov Mathematical Institute, Russia

    6 publications · 150 citations

    6

    h-index

  2. MR
    Misha Rudnev

    University of Bristol, United Kingdom

    5 publications · 123 citations

    5

    h-index

  3. CS
    Carsten Schneider

    Johannes Kepler University of Linz, Austria

    3 publications · 157 citations

    3

    h-index

  4. PE
    P. Erdös

    Hungarian Academy of Sciences, Hungary

    3 publications · 144 citations

    3

    h-index

  5. TT
    Terence Tao

    University of California, Los Angeles, United States

    3 publications · 438 citations

    3

    h-index

1–5 of 79

Venues

  1. Advances in Mathematics

    3 publications · 108 citations

    3

    h-index

  2. Animal Learning & Behavior

    2 publications · 106 citations

    2

    h-index

  3. Acta Arithmetica

    2 publications · 82 citations

    2

    h-index

  4. Journal of Symbolic Computation

    2 publications · 132 citations

    2

    h-index

  5. European Journal of Combinatorics

    2 publications · 120 citations

    2

    h-index

1–5