REVIEW 1 cited by
Higher order Fourier analysis as an algebraic theory II
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
read the original abstract
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of approximative statements. The present paper is the second part of a paper in which higher order characters and decompositions were introduced. We generalize the concept of the Pontrjagin dual group and introduce higher order versions of it. We study the algebraic structure of the higher order dual groups. We prove a simple formula for the Gowers uniformity norms in terms of higher order decompositions. We present a simple spectral algorithm to produce higher order decompositions. We briefly study a multi linear version of Fourier analysis. Along these lines we obtain new inverse theorems for Gowers's norms.
Forward citations
Cited by 1 Pith paper
-
Spectral algorithms in higher-order Fourier analysis
A spectral inverse theorem and a spectral regularity theorem show that leading eigenvectors of Fourier-denoised matrices recover quadratic Fourier structure, giving new algorithms for quadratic denoising and character...
Discussion (0). Continue with ORCID to comment.