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

Home > Combinatorics Seminar

Improved bounds for sunflowers [1]

  • Read more about Improved bounds for sunflowers [1]

On some properties of graph norms [2]

  • Read more about On some properties of graph norms [2]

Eigenvectors of Ginibre matrices [3]

  • Read more about Eigenvectors of Ginibre matrices [3]

Approximate Spielman-Teng theorems [4]

  • Read more about Approximate Spielman-Teng theorems [4]

Hard to believe: The Surprising Mathematics of Belief Propagation on Trees [5]

  • Read more about Hard to believe: The Surprising Mathematics of Belief Propagation on Trees [5]

Optimizing and certifying bounds of random functions over the hypercube [6]

  • Read more about Optimizing and certifying bounds of random functions over the hypercube [6]

Factors of sparse polynomials: structural results and some algorithms [7]

  • Read more about Factors of sparse polynomials: structural results and some algorithms [7]

Improved list decodability of polynomial codes [8]

  • Read more about Improved list decodability of polynomial codes [8]

Using random polynomials in extremal graph theory [9]

  • Read more about Using random polynomials in extremal graph theory [9]

Quantum state transfer on graphs - using magnetic fields [10]

  • Read more about Quantum state transfer on graphs - using magnetic fields [10]
  • « first [11]
  • ‹ previous [11]
  • 1 [11]
  • 2
  • 3 [12]
  • 4 [13]
  • 5 [14]
  • 6 [15]
  • 7 [16]
  • 8 [17]
  • 9 [18]
  • …
  • next › [12]
  • last » [19]
Visit our web site at http://math.yale.edu for updates and special announcements

Links
[1] https://calendar.math.yale.edu/event/improved-bounds-sunflowers [2] https://calendar.math.yale.edu/event/some-properties-graph-norms [3] https://calendar.math.yale.edu/event/eigenvectors-ginibre-matrices [4] https://calendar.math.yale.edu/event/approximate-spielman-teng-theorems [5] https://calendar.math.yale.edu/event/hard-believe-surprising-mathematics-belief-propagation-trees [6] https://calendar.math.yale.edu/event/optimizing-and-certifying-bounds-random-functions-over-hypercube [7] https://calendar.math.yale.edu/event/factors-sparse-polynomials-structural-results-and-some-algorithms [8] https://calendar.math.yale.edu/event/improved-list-decodability-polynomial-codes [9] https://calendar.math.yale.edu/event/using-random-polynomials-extremal-graph-theory [10] https://calendar.math.yale.edu/event/quantum-state-transfer-graphs-using-magnetic-fields [11] https://calendar.math.yale.edu/seminars/combinatorics-seminar [12] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=2 [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=7 [18] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=8 [19] https://calendar.math.yale.edu/seminars/combinatorics-seminar?page=11