Structure and randomness in combinatorics Export

@misc{citeulike:1524507, 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.}, archivePrefix = {arXiv}, author = {Tao, Terence}, citeulike-article-id = {1524507}, citeulike-linkout-0 = {http://arxiv.org/abs/0707.4269}, citeulike-linkout-1 = {http://arxiv.org/pdf/0707.4269}, day = {29}, eprint = {0707.4269}, keywords = {combinatorics, survey}, month = {Jul}, posted-at = {2007-08-01 19:50:21}, priority = {2}, title = {Structure and randomness in combinatorics}, url = {http://arxiv.org/abs/0707.4269}, year = {2007} }

TY - ELEC ID - citeulike:1524507 L3 - citeulike-article-id:1524507 N2 - 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. TI - Structure and randomness in combinatorics KW - combinatorics KW - survey AU - Tao, Terence PY - 2007/Jul/29/ UR - http://arxiv.org/abs/0707.4269 ER -