Year: 2007
Type: preprint
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 \emph{structured} component, a \emph{pseudo-random} component, and a \emph{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.
Source: arXiv (Cornell University)
Author: Tao, Terence
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4307480506