Structure and Randomness in Combinatorics

Authors:
Terence Tao
Affiliations:
UCLA, Los Angeles
Venue:
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Year:
2007

Citing 0
Cited 5

Inverse conjecture for the gowers norm is false

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Guest column: additive combinatorics and theoretical computer science

ACM SIGACT News
A Hypergraph Dictatorship Test with Perfect Completeness

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Query-efficient dictatorship testing with perfect completeness

Property testing
Query-efficient dictatorship testing with perfect completeness

Property testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has proven profitable to decompose such objects into a structured component, a pseudo-random component, and a small component (i.e. an error term); in many cases it is the structured component which then dominates. We illustrate this philosophy in a number of model cases.