Friedgut-Kalai-Naor for Boolean Functions on S_n

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


Duration: 52:53
290 views
1

Yuval Filmus, University of Toronto
Neo-Classical Methods in Discrete Analysis
http://simons.berkeley.edu/talks/yuval-filmus-2013-12-02



Other Videos By Simons Institute for the Theory of Computing


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
2013-11-30The Emergence of Convention: An Experimental Study of Social Order
2013-11-30Overview: Scalability/Practical Challenges
2013-11-30Overview: Networks Over Time
2013-11-30Overview: Label Prediction/Diffusion
2013-11-30Overview: Causality/Experiments
2013-11-30Overview: Clustering


Tags:
Simons Institute
Real Analysis
UC Berkeley
computer science
theory of computing
Yuval Filmus