Terence Tao
Published 2007-07-29, updated 2007-08-03Version 2
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.
Comments: 13 pages, no figures. FOCS 2007 tutorial notes. Minor corrections
The Algebra and Combinatorics of Shuffles and Multiple Zeta Values
The combinatorics of k-marked Durfee symbols
On the Combinatorics of the Boros-Moll Polynomials
![QR code for arXiv:0707.4269 [math.CO]](http://oss.arxitics.com/images/favicon.svg)