Undecidability of Linear Inequalities Between Graph Homomorphism Densities

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=UuNsWAUpPYM


Duration: 48:46
297 views
3

Hamed Hatami, McGill University
Neo-Classical Methods in Discrete Analysis
http://simons.berkeley.edu/talks/hamed-hatami-2013-12-04



Other Videos By Simons Institute for the Theory of Computing


2013-12-12Some Pseudorandom Phenomena in Finite Fields
2013-12-12Partial Difference Equations Over Compact Abelian Groups
2013-12-12Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
2013-12-12Laplacian Eigenvalues, Metric Uniformization, and Incidence Geometry
2013-12-12Incidence Geometry and Applications to Theoretical Computer Science
2013-12-12Counting Sumsets and Applications
2013-12-12The Structure of Low Rank Matrices
2013-12-12Building Monotone Expanders
2013-12-12Small Lifts of Expander Graphs are Expanding
2013-12-12Non-commutative Computation
2013-12-12Undecidability of Linear Inequalities Between Graph Homomorphism Densities
2013-12-12Ultraproducts as a Bridge Between Discrete and Continuous Analysis
2013-12-12Algorithmic Regularity for Polynomials and Applications
2013-12-12The Green-Tao Theorem and a Relative Szemeredi Theorem
2013-12-12Carries and Cocycles
2013-12-12A Short Proof of Gowers' Lower Bound for the Regularity Lemma
2013-12-12Friedgut-Kalai-Naor for Boolean Functions on S_n
2013-12-12Families of Permutations with Forbidden Intersection-sizes
2013-12-12Quantitative Aspects of the Idempotent Theorem
2013-12-12Structure of the Fourier Spectrum of Boolean Functions and Complexity
2013-12-12Threshold, Influence, Noise, and Discrete Harmonic Analysis


Tags:
Simons Institute
Real Analysis
UC Berkeley
computer science
theory of computing
Hamed Hatami