Pith. sign in

REVIEW 2 cited by

Montreal Lecture Notes on Quadratic Fourier Analysis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0604089 v2 pith:SMLBHJJD submitted 2006-04-04 math.CA math.CO

classification math.CAmath.CO
keywords notesquadraticwilladditiveanalysisfourierlecturesmany
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

These are notes to accompany four lectures that I gave at the School on Additive Combinatorics, held in Montreal, Quebec between March 30th and April 5th 2006. My aim is to introduce ``quadratic fourier analysis'' in so far as we understand it at the present time. Specifically, we will describe ``quadratic objects'' of various types and their relation to additive structures, particularly four-term arithmetic progressions. I will focus on qualitative results, referring the reader to the literature for the many interesting quantitative questions in this theory. Thus these lectures have a distinctly ``soft'' flavour in many places. Some of the notes cover unpublished work which is joint with Terence Tao. This will be published more formally at some future juncture.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A weak regularity lemma for polynomials

    math.CO 2025-09 conditional novelty 8.0 of 10

    A weak regularity lemma decomposes polynomial maps into few approximately independent homogeneous parts, with bounds polynomial in the number of polynomials, and implies stronger quantitative versions of rank and arit...

  2. On Approximability of Satisfiable k-CSPs: V

    cs.CC 2024-08 unverdicted novelty 8.0 of 10

    A hybrid SDP-plus-linear-algebra algorithm and matching hardness result for satisfiable k-CSPs, enabled by a novel mixed invariance principle extending Mossel-O'Donnell-Oleszkiewicz.

Pith tools