Jean Bourgain's
Work Algorithms

A bibliographic reconstruction of Bourgain's mathematical operating system from papers, monographs, lecture series, and book-chapter style records. Each case is treated as a lecture-level thesis/result rather than a reproduced text passage. Strategy tags are overlapping: percentages report case prevalence, so totals need not sum to 100%.

Institute for Advanced Study300-case corpus33 reconstructed strategiesoverlapping prevalence histograms
00

Research-page premise

Bourgain's work repeatedly converts a hard question into a quantitative core: a finite-dimensional obstruction, a frequency-localized inequality, a multiscale PDE induction, a sum-product growth theorem, a spectral-gap mechanism, or an inverse theorem. This page reconstructs those moves as an explicit decision tree.

Methodological rule: no posthumous development is assumed as part of Bourgain's own derivation. Later terminology is used only as retrospective labeling when it clarifies the reconstructed route.

01

Thirty-three reconstructed strategies

Select a strategy

Click a card above to see its inferred use, formula cue, and case evidence.

02

Overlapping prevalence ranking

Because each case may use several strategies, the percentages below are prevalence rates: count divided by 300 cases. They are not normalized to sum to 100%.

03

300 publication / chapter cases

#YearCase / lecture titleSourceThesis/result abstractionStrategies
04

Worked reconstructions

05

Source spine and limitations

This page uses bibliographic records as its case spine. It does not reproduce Bourgain's copyrighted papers or book chapters. The case summaries are compressed thesis/result abstractions intended for research navigation and methodological comparison.

The first 300 entries of the public publication list are used as a stable corpus even though the list continues beyond that point. Lecture-series and book/chapter records are incorporated when they occur in the bibliography and in the source-spine notes.