Published on Department of Mathematics Calendar (https://calendar.math.yale.edu)

Home > Combinatorics Seminar

A simple algorithm for finding clusters in a random environment [1]

  • Read more about A simple algorithm for finding clusters in a random environment [1]

The minimum number of nonnegative edges in hypergraphs [2]

  • Read more about The minimum number of nonnegative edges in hypergraphs [2]

Log-integrability of Rademacher Fourier series and applications to random analytic functions [3]

  • Read more about Log-integrability of Rademacher Fourier series and applications to random analytic functions [3]

Breaking the quadratic barrier for 3 query LCCs over the reals [4]

  • Read more about Breaking the quadratic barrier for 3 query LCCs over the reals [4]

A Proof of the Manickam-Miklos-Singhi Conjecture for Vector Spaces [5]

  • Read more about A Proof of the Manickam-Miklos-Singhi Conjecture for Vector Spaces [5]

Breaking barrier for deterministic poly-time approximation of the permanent and settling Friedland [6]

  • Read more about Breaking barrier for deterministic poly-time approximation of the permanent and settling Friedland [6]

TBA [7]

  • Read more about TBA [7]

TBA [8]

  • Read more about TBA [8]

Smoothed analysis on connected graphs [9]

  • Read more about Smoothed analysis on connected graphs [9]

How many real zeroes does a random polynomial have ? (Talk 2) [10]

  • Read more about How many real zeroes does a random polynomial have ? (Talk 2) [10]
  • « first [11]
  • ‹ previous [12]
  • …
  • 4 [13]
  • 5 [14]
  • 6 [15]
  • 7 [16]
  • 8 [12]
  • 9
  • 10 [17]
  • 11 [18]
  • 12 [19]
  • next › [17]
  • last » [19]
Visit our web site at http://math.yale.edu for updates and special announcements

Links
[1] https://calendar.math.yale.edu/event/simple-algorithm-finding-clusters-random-environment [2] https://calendar.math.yale.edu/event/minimum-number-nonnegative-edges-hypergraphs [3] https://calendar.math.yale.edu/event/log-integrability-rademacher-fourier-series-and-applications-random-analytic-functions [4] https://calendar.math.yale.edu/event/breaking-quadratic-barrier-3-query-lccs-over-reals [5] https://calendar.math.yale.edu/event/proof-manickam-miklos-singhi-conjecture-vector-spaces [6] https://calendar.math.yale.edu/event/breaking-barrier-deterministic-poly-time-approximation-permanent-and-settling-friedland [7] https://calendar.math.yale.edu/event/tba-35 [8] https://calendar.math.yale.edu/event/tba-34 [9] https://calendar.math.yale.edu/event/smoothed-analysis-connected-graphs [10] https://calendar.math.yale.edu/event/how-many-real-zeroes-does-random-polynomial-have-talk-2 [11] https://calendar.math.yale.edu/seminars/combinatorics-seminar [12] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=7 [13] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=3 [14] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=4 [15] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=5 [16] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=6 [17] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=9 [18] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=10 [19] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=11