Pith. sign in

REVIEW 1 major objections 5 minor 71 references

Spectral algorithms in higher-order Fourier analysis

T0 review · 1 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that the quadratically structured part of a 1-bounded function on a finite abelian group is algorithmically recoverable from the dominant eigenspaces of the denoised matrix $K_\varepsilon(f\otimes f)$, with $U^3$ error…

desk verdict Genuinely new spectral machinery for quadratic Fourier analysis, with a proof core that looks sound despite one misbegotten stress-test objection. read the letter →

arxiv 2501.12287 v1 pith:RLKENNUO submitted 2025-01-21 math.CO math.SP

Pablo Candela , Diego González-Sánchez , Balázs Szegedy This is my paper · ORCID
classification math.COmath.SP MSC 11B30
keywords higher-orderFourieranalysisGowersnormsquadraticnilspacecharacterstheoryspectralalgorithmsregularitytheoremsinverse
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper sets out to make higher-order Fourier analysis algorithmic by tying it to spectral theory. Its central theorem, Theorem 1.1, says that for every 1-bounded function $f$ on a finite abelian group one can choose a soft Fourier threshold $\varepsilon$ and an eigenvalue cut-off $\rho$ so that projecting $f$ onto the eigenspaces of the denoised matrix $K_\varepsilon(f\otimes f)$ with eigenvalue at least $\rho$ yields a quadratically structured approximation $f_{\mathrm{reg}}$ with $\|f-f_{\mathrm{reg}}\|_{U^3}\leq 2\rho^{3/8}$. The approximation is genuinely of quadratic order: $f_{\mathrm{reg}}$ is $L^2$-close to a function of bounded $U^3$-dual norm. If correct, this replaces intricate nilspace decompositions by a direct, non-iterative computation using Fourier transforms and matrix diagonalization, and it points to a general order-increment principle for higher orders.

What carries the argument

The central objects are the Fourier denoising operator $K_\varepsilon$ and nilspace characters. The operator $K_\varepsilon$ acts on a function's Fourier expansion by keeping coefficients of magnitude at least $\varepsilon$ and shrinking their magnitudes by $\varepsilon$, a soft threshold; applied to every diagonal $x\mapsto f(x+t)\overline{f(x)}$ of $f\otimes f$, it produces a self-adjoint matrix whose eigenvectors are candidates for quadratic characters. A 2-step nilspace character is a function $F_\chi\circ\phi$, where $\phi$ is a balanced structure-preserving map from the group into a compact finite-rank nilspace and $F_\chi$ is a bounded Lipschitz function with vertical frequency $\chi$ in the top structure group; these generalize Fourier characters to quadratic order. The balance property makes distinct nilspace characters nearly orthogonal and makes each one a pseudoeigenvector, so the spectral data of $K_\varepsilon(f\otimes f)$ can be converted into quadratic components.

What would settle it

Numerically check the claimed bound on a cyclic group: fix $\rho_0$, take $f$ to be a random 1-bounded function and also a quadratic phase $f(x)=e^{2\pi i x^2/N}$ plus noise, diagonalize $K_\varepsilon(f\otimes f)$, form $f_{\mathrm{reg}}$ from eigenvalues at least $\rho$, and compute $\|f-f_{\mathrm{reg}}\|_{U^3}$; a violation of $\|f-f_{\mathrm{reg}}\|_{U^3}\leq 2\rho^{3/8}$ for any $N$, $\rho\in[\rho_0/2,\rho_0]$, and $\varepsilon\in[\varepsilon_0,1]$ would refute Theorem 1.1, and sustained agreement would support it.

Watch

Extended reading notes

Core claim

The central discovery is that the quadratic Fourier components of $f$ are encoded as pseudoeigenvectors of $K_\varepsilon(f\otimes f)$: up to small error, this self-adjoint matrix equals a sum of rank-one matrices $g_\chi\otimes g_\chi$, where the $g_\chi$ are nearly orthogonal 2-step nilspace characters. Consequently each normalized $g_\chi$ almost satisfies the eigenvector equation, with pseudoeigenvalue $\|g_\chi\|_2^2$, and when its eigenvalue is large and separated, the corresponding true eigenvector is close to $g_\chi$. This yields the spectral inverse theorem and the spectral regularity theorem: a function with large $U^3$-norm correlates with a quadratic character, and the projection onto dominant eigenspaces is an order-2 structured function.

Load-bearing premise

The entire spectral recovery inherits its quantitative strength from the imported nilspace regularity theorem [12, Theorem 1.5]: every 1-bounded function decomposes, up to arbitrarily small $U^{k+1}$ error, as $F\circ\phi$ with $\phi$ a highly balanced nilspace morphism and $F$ a bounded Lipschitz function; if that decomposition theorem or the balance-to-quasiorthogonality conversion in Proposition 4.21 fails, the spectral inverse and regularity theorems do not follow.

Editorial extensions

If this is right

  • The projection computed in Algorithm 1 is a spectral $U^3$-regularisation: it is close to $f$ in the $U^3$-norm and is an order-2 structured function in the sense of Definition 2.23.
  • When the relevant eigenvalues are separated, or when separation is achieved by a random unit vector in the dominant eigenspace, Algorithm 2 recovers the individual quadratic characters of $f$ from eigenvectors of $K_\varepsilon(h\otimes h)$.
  • The refined regularity theorem decomposes the structured part into boundedly many nearly orthogonal nilspace characters, yielding approximate Parseval identities and approximate diagonalizations of the Gowers norms.
  • Theorem 5.3 is a new inverse theorem with nilspace characters: a function with $U^{k+1}$-norm at least $\delta$ correlates with one of $O_\delta(1)$ nilspace characters.
  • The method works on every finite abelian group and uses only Fourier transforms and eigendecompositions, so quadratic Fourier analysis becomes algorithmic without finite-field restrictions and without iterative probabilistic searches.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: the soft-thresholded matrix $K_\varepsilon(f\otimes f)$ functions as a quadratic analogue of a covariance or Gram matrix, so its top eigenvectors could serve as quadratic principal components for denoising ordered data or time series; the paper only sketches this through a numerical illustration.
  • Editorial extension: the order-increment principle suggests a spectral hierarchy—applying the same construction to eigenvectors of $K_\varepsilon(f\otimes f)$ should reveal cubic structure—but the paper leaves the higher-order algorithm to future work.
  • Editorial extension: the randomized separation step is likely replaceable by a deterministic choice of $h$ in the dominant eigenspace; the paper itself notes this as an open direction, and a deterministic version would make Algorithm 2 fully deterministic.
  • Editorial extension: the approximate diagonalization of the $U^{k+1}$-norm suggests a fast uniformity test—estimate a function's Gowers norm from the norms of its dominant nilspace characters instead of averaging over all cubes.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The paper develops a spectral approach to higher-order Fourier analysis, focusing on the quadratic case. Given a 1-bounded function f on a finite abelian group Z, the authors study the matrix Kε(f⊗f) obtained by applying the soft-thresholding Fourier denoising operator Kε to each Z-diagonal of f⊗f. The main results are: (1) a refined nilspace regularity theorem (Theorem 5.1) expressing the structured part of f as a sum of quasiorthogonal nilspace characters; (2) a structure theorem for Kε(f⊗f) (Theorem 6.1) as a sum of rank-one matrices from these characters plus a small error; (3) a spectral U3-regularization theorem (Theorem 7.12, implying Theorem 1.1) showing that the projection of f onto the leading eigenspace of Kε(f⊗f) is close to f in the U3-norm and is a structured function of order 2; and (4) a recovery theorem (Theorem 7.15) for individual quadratic characters from eigenvectors under a spectral separation assumption. The paper also presents two algorithms and a numerical illustration. The proofs are detailed and rely on the nilspace regularity theorem of [12] and on the authors' own refinements.

Significance. This is a substantial contribution that establishes a new connection between spectral decompositions of a natural self-adjoint operator and higher-order Fourier structure, yielding quantitative inverse and regularity theorems for the Gowers U3-norm. The algorithmic corollaries are plausible and the numerical demonstration, while preliminary, is suggestive. The proofs are rigorous and transparent in their use of the cited nilspace regularity theorem, and the paper honestly acknowledges the non-constructive nature of the parameters (Remark 1.3). The main theorems (Theorems 1.1, 6.1, 7.12) are well-supported, and the proofs are detailed enough to be checked. The only mathematical issue I found is a false statement in Lemma 5.8, which is local and does not affect the main results because the proofs use the valid s ≥ 3 case or the second inequality of that lemma.

major comments (1)
  1. [Lemma 5.8, Eq. (47)] As stated, the first inequality in (47) is false for s=2. Let Z be a finite abelian group and H a subgroup of density α ∈ (0,1), and take f = 1_H. Then ∥f∥_{U^2}^4 = α^3, while the expression inside the minimum in (47) for s=2 evaluates to min(α^8, α^3) = α^8, so the claimed inequality fails. The proof's two-disjoint-stars argument applies only for s ≥ 3, and the exponent in the first term should be 2s+2 rather than 2^{s+2}. Since the main theorems apply the lemma only with s = k+1 ≥ 3, or else use the second inequality which is valid for all s ≥ 2, this error is local and does not invalidate Theorem 7.12 or Theorem 1.1. However, the lemma as printed is mathematically false and should be corrected.
minor comments (5)
  1. [Theorem 7.12 proof] In the proof of Theorem 7.12, the sentence 'using the fact that the L2-norm dominates the U3-norm' is correct, since the inequality ∥g∥_{U^3} ≤ ∥g∥_2 follows from the s=3 case of Lemma 5.8 (with the corrected exponent), but a pointer to that lemma would help the reader.
  2. [Remark 1.3] Theorem 1.1 only asserts the existence of ε0 and ρ but does not provide a constructive method to find them. Since Algorithm 1 requires ε and ρ as inputs, the paper should state explicitly that the practical choice of these parameters is heuristic and not guaranteed by the theorem, especially given the paper's emphasis on 'simple and practical algorithms'.
  3. [Algorithm 1] No complexity bound is given for the algorithm. The authors could add a sentence noting that the construction of M involves |Z| applications of Kε (each O(|Z| log |Z|) via FFT) and that the eigendecomposition of a |Z|×|Z| matrix is O(|Z|^3) in a naive implementation, to substantiate the practical claim.
  4. [Proof of Proposition 5.10] The definition of c1 in the proof is terse; it would be clearer to display the intermediate bound ∥P_{χ∈S∖S_ρ} g_χ∥_{U^{k+1}} ≤ ρ^{(k+1)/2^{k+1}}(1+c0)^{1/2^{k+1}} + |S|D(η,m)^{1/2^{k+1}} before taking the final estimate.
  5. [Abstract and Introduction] The abstract states that the algorithms are 'simple and practical', but the parameter-dependence is deferred to future work. A caveat in the introduction (e.g., in Remark 1.3) would prevent overstatement of the current algorithmic contribution.

Circularity Check

0 steps flagged · score 1.0 of 10

No substantive circularity: the spectral regularity and inverse theorems are derived from the imported nilspace regularity theorem and quantitative Fourier/nilspace lemmas; no fitted quantity is renamed as a prediction.

full rationale

I traced the derivation of Theorem 1.1 back through Theorem 7.12 to Theorem 6.1, Proposition 5.10, Theorem 5.1, and the imported nilspace regularity theorem [12, Theorem 1.5]. Theorem 5.1 is a genuine refinement: it starts from the [12] decomposition f = fs + fe + fr, expands fs = F∘ϕ by vertical-frequency Fourier series on the last structure group, and uses the balance of ϕ to deduce quasiorthogonality of the resulting nilspace characters. None of these steps defines a target object in terms of the spectral projection being constructed. Theorem 6.1 then applies Proposition 3.17 with the regularity data; the parameters η, D, and ε are chosen freely at the start and later constrained to achieve bounds, but they are not fitted to the conclusion. Theorem 7.12 propagates the U3 error bound from Proposition 5.10, Equation (49), and controls the projection distance Pρ(f) − Σ_{χ∈Sρ} gχ using matrix perturbation and quantitative Gram-Schmidt; this does not assume the spectral regularization it proves. The self-citations to [56,57] appear as motivation for the order-increment principle and as the qualitative ultralimit analogue, not as proof inputs for the finite-group estimates. The only flagged concern is the proof phrase in Theorem 7.12, 'the fact that the L2-norm dominates the U3-norm'; the proposed Z2 counterexample for 1_{0} computes the U3 norm incorrectly (it is 2^{-1/2}, equal to the L2 norm, not 2^{-3/8}), and in any case a possible gap on that inequality would be a correctness issue rather than a circularity. Overall, the central claim has independent content: the spectral data are consequences of the regularity theorem and auxiliary inequalities, not restatements of those inputs.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The paper introduces no fitted constants or new physical entities. Its quantitative theorems depend on thresholds ε, ρ, and δ that are user-chosen parameters, and on deep prior nilspace results treated as axioms.

free parameters (3)
  • denoising threshold ε = not specified
    Algorithm 1 takes ε as input; Remark 1.3 says optimal values depend heavily on the dataset and no selection rule is given. The theorems only assert existence of some ε in [ε0,1].
  • eigenvalue threshold ρ = not specified
    Theorem 1.1 guarantees existence of ρ in [ρ0/2, ρ0] depending on f, but Algorithm 1 requires ρ as input and no constructive rule is provided.
  • separation threshold δ = not specified
    Algorithm 2 uses δ (e.g. δ = ρ^7) to decide when eigenvalues are separated; the practical choice is left open.
assumptions (3)
  • domain assumption Nilspace regularity theorem [12, Theorem 1.5]: every 1-bounded function on a finite abelian group has a decomposition f = F∘φ + fe + fr with φ balanced into a bounded-complexity CFR nilspace and fr small in U3.
    Invoked as the starting point of Theorem 5.1 and hence of Theorems 7.12 and 7.15. The present paper refines but does not prove this theorem.
  • domain assumption CFR nilspace structure theory: iterated principal abelian bundle structure, Haar measure, vertical frequency components, and Lipschitz approximation by vertical Fourier sums (Lemmas 4.10, 4.11, Proposition 4.28).
    Used to define nilspace characters and to prove the refined regularity and diagonalization theorems.
  • standard math Standard Fourier analysis and Gowers-Cauchy-Schwarz inequality on finite abelian groups.
    Used throughout for Fourier coefficients, Plancherel, the formula ||f||_{U2} = ||f_hat||_ℓ4, and the U3 estimates in Section 3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Spectral algorithms in higher-order Fourier analysis." pith.science (2026). https://pith.science/paper/RLKENNUO

@misc{pith2026250112287,
  author       = {Pith},
  title        = {Pith review of: Spectral algorithms in higher-order Fourier analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RLKENNUO}},
  note         = {Machine review of arXiv:2501.12287}
}
read the original abstract

Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for such algorithms and provide a detailed analysis of the quadratic case. Our results reveal new spectral aspects of the theory underlying higher-order Fourier analysis. Along these lines, we prove new inverse and regularity theorems for the Gowers norms based on higher-order character decompositions. Using these results, we prove a spectral inverse theorem and a spectral regularity theorem in quadratic Fourier analysis.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

71 extracted references · 65 canonical work pages

  1. [12]

    Candela, B

    P. Candela, B. Szegedy, Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds, J. Reine Angew. Math. 789 (2022), 1–42

    work page 2022

  2. [1]

    Aaronson, Algorithms for Boolean Function Query Properties , SIAM J

    S. Aaronson, Algorithms for Boolean Function Query Properties , SIAM J. Comput. 32 (2003), no. 5, 1140– 1157

    work page 2003

  3. [2]

    N. I. Akhiezer, I.M. Glazman, Theory of linear operators in Hilbert space. Vol. I., translated from the third Rus- sian edition by E. R. Dawson. Translation edited by W. N. Everitt Monogr. Stud. Math., 9 Pitman (Advanced Publishing Program), Boston, Mass.-London, 1981. xxxii+312 pp

    work page 1981

  4. [3]

    N. Alon, E. Fischer, M. Krivelevich, M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), no. 4, 451–476

    work page 2000

  5. [4]

    Bourbaki, Elements of mathematics

    N. Bourbaki, Elements of mathematics. General topology. Part 1.Hermann, Paris; Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont. 1966

    work page 1966

  6. [5]

    O. A. Camarena, B. Szegedy, Nilspaces, nilmanifolds and their morphisms, (2010), arXiv:1009.3825

    arXiv 2010

  7. [6]

    Candela, Notes on nilspaces: algebraic aspects, Discrete Anal

    P. Candela, Notes on nilspaces: algebraic aspects, Discrete Anal. 2017, Paper No. 15, 59 pp

    work page 2017

  8. [7]

    Candela, Notes on compact nilspaces, Discrete Anal

    P. Candela, Notes on compact nilspaces, Discrete Anal. 2017, Paper No. 16, 57 pp

    work page 2017

Show all 71 references
  1. [8]

    Candela, D

    P. Candela, D. Gonzalez-Sanchez, B. Szegedy, On nilspace systems and their morphisms , Ergodic Theory Dynam. Systems 40 (2020), no. 11, 3015–3029

    2020

  2. [9]

    Candela, D

    P. Candela, D. Gonzalez-Sanchez, B. Szegedy, On higher-order Fourier analysis in characteristic p, Ergodic Theory Dynam. Systems 43 (2023), no. 12, 3971–4040

    2023

  3. [10]

    Candela, D

    P. Candela, D. Gonzalez-Sanchez, B. Szegedy, Free nilspaces, double coset nilspaces and Gowers norms , (2023), arXiv:2305.11233

    2023

  4. [11]

    Candela, B

    P. Candela, B. Szegedy, Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits, Mem. Amer. Math. Soc. 287 (2023), no. 1425, v+101 pp

    2023

  5. [13]

    M. P. do Carmo, Geometria riemanniana.[Riemannian geometry] , Projeto Euclides, 10 [Euclid Project], Instituto de Matem´atica Pura e Aplicada, Rio de Janeiro, 1979. ix+238 pp

    1979

  6. [14]

    Cobzas ¸, R

    S ¸. Cobzas ¸, R. Miculescu, A. Nicolae,Lipschitz functions, Lecture Notes in Math., 2241 Springer, Cham,

  7. [15]

    D. L. Cohn, Measure theory, Second edition, Birkh¨auser/Springer, New York, 2013. xxi+457 pp

    2013

  8. [16]

    Eisner, T

    T. Eisner, T. Tao, Large values of the Gowers-Host-Kra seminorms, J. Anal. Math. 117 (2012), 133–186

    2012

  9. [17]

    A. M. Frieze, R. Kannan, Quick Approximation to Matrices and Applications, Combinatorica 19 (1999), pp. 175–220

    1999

  10. [18]

    A. M. Frieze, R. Kannan, A Simple Algorithm for Constructing Szemer´edi’s Regularity Partition, Electron. J. Combin., 6, (1999), #R17, 7pp. 70 PABLO CANDELA, DIEGO GONZ ´ALEZ-S ´ANCHEZ, AND BAL ´AZS SZEGEDY

    1999

  11. [19]

    Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemer ´edi on arithmetic progres- sions, J

    H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemer ´edi on arithmetic progres- sions, J. Analyse Math. 31 (1977), 204–256

    1977

  12. [20]

    N. R. Goodman, Statistical Analysis Based on a Certain Multivariate Complex Gaussian Distribution (An Introduction), Ann. Math. Statist. 34 (1963), 152–177

    1963

  13. [21]

    B. I. Golubov, Multiple series and Fourier integrals.(Russian) Mathematical analysis, V ol. 19, pp. 3–54, 232 Itogi Nauki i Tekhniki [Progress in Science and Technology] Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Inform., Moscow, 1982

    1982

  14. [22]

    W. T. Gowers, A new proof of Szemer´edi’s theorem, Geom. Funct. Anal., 11 (2001), 465–588

    2001

  15. [23]

    W. T. Gowers, Hypergraph regularity and the multidimensional Szemer ´edi theorem,Ann. of Math. (2) 166 (2007), no. 3, 897–946

    2007

  16. [24]

    W. T. Gowers, Decompositions, approximate structure, transference, and the Hahn-Banach theorem , Bull. Lond. Math. Soc. 42 (2010), no. 4, 573–606

    2010

  17. [25]

    W. T. Gowers, Generalizations of Fourier analysis, and how to apply them, Bull. Amer. Math. Soc. (N.S.) 54 (2017), no. 1, 1–44

    2017

  18. [26]

    W. T. Gowers, L. Mili ´cevi´c, A quantitative inverse theorem for the U 4 norm over finite fields , (2020), arXiv:1712.00241

    2020 arXiv

  19. [27]

    W. T. Gowers, L. Mili ´cevi´c, An inverse theorem for Freiman multi-homomorphisms , (2020), arXiv:2002.11667

    2020 arXiv

  20. [28]

    Gowers, J

    W.T. Gowers, J. Wolf, Linear forms and higher-degree uniformity for functions on Fn p , Geom. Funct. Anal. 21 (2011), no. 1, 36–69

    2011

  21. [29]

    W. T. Gowers, J. Wolf, The true complexity of a system of linear equations , Proc. Lond. Math. Soc., (1) 100 (2010), 155-176.21

    2010

  22. [30]

    Green, T

    B. Green, T. Sanders, Boolean Functions with small Spectral Norm , Geom. Funct. Anal. 18 (2008), no. 1, 144–162

    2008

  23. [31]

    Green, T

    B. Green, T. Tao, An arithmetic regularity lemma, an associated counting lemma, and applications , in An Irregular Mind, Bolyai Soc. Math. Stud. 21, J´anos Bolyai Mathematical Society, Budapest, 2010, pp. 261–334

    2010

  24. [32]

    Green, T

    B. Green, T. Tao, An inverse theorem for the Gowers U 3-norm, Proc. Edinburgh Math. Soc. (1) 51 (2008), 73-153

    2008

  25. [33]

    Green, T

    B. Green, T. Tao, The primes contain arbitrarily long arithmetic progressions, Ann. of Math. (2) 167 (2008), pp. 481–547

    2008

  26. [34]

    Green, T

    B. Green, T. Tao, The quantitative behaviour of polynomial orbits on nilmanifolds , Ann. of Math. (2) 175 (2012), no. 2, 465–540

    2012

  27. [35]

    Green, T

    B. Green, T. Tao, T. Ziegler, An inverse theorem for the Gowers U s+1[N ]-norm, Ann. of Math. (2) 176 (2012), no. 2, 1231–1372

    2012

  28. [36]

    Gut, An Intermediate Course in Probability, Second edition, Springer Texts Statist

    A. Gut, An Intermediate Course in Probability, Second edition, Springer Texts Statist. Springer, New York,

  29. [37]

    Gutman, F

    Y . Gutman, F. Manners, P. P. Varj´u, The structure theory of nilspaces I , J. Anal. Math. 140 (2020), no. 1, 299–369

    2020

  30. [38]

    Gutman, F

    Y . Gutman, F. Manners, P. P. Varj ´u, The structure theory of nilspaces II: Representation as nilmanifolds , Trans. Amer. Math. Soc. 371 (2019), no. 7, 4951–4992

    2019

  31. [39]

    Gutman, F

    Y . Gutman, F. Manners, P. P. Varj´u, The structure theory of nilspaces III: Inverse limit representations and topological dynamics, Adv. Math. 365 (2020), 107059, 53 pp

    2020

  32. [40]

    Hatami, P

    H. Hatami, P. Hatami, S. Lovett, Higher-order Fourier analysis and applications , Found. Trends Theor. Comput. Sci. 13 (2019), no. 4, front matter, 247–448

    2019

  33. [41]

    R. A. Horn, C. R. Johnson, Matrix Analysis, Second edition, Cambridge University Press, Cambridge, 2013. xviii+643 pp

    2013

  34. [42]

    B. Host, B. Kra, Nonconventional ergodic averages and nilmanifolds, Ann. of Math. (2) 161 (2005), no. 1, 397–488

    2005

  35. [43]

    B. Host, B. Kra, Parallelepipeds, nilpotent groups, and Gowers norms, Bull. Soc. Math. France 136 (2008), no. 3, 405–437

    2008

  36. [44]

    Jamneshan, T

    A. Jamneshan, T. Tao, The inverse theorem for the U 3 Gowers uniformity norm on arbitrary finite abelian groups: Fourier-analytic and ergodic approaches, Discrete Anal. 2023, Paper No. 11, 48 pp

    2023

  37. [45]

    Jamneshan, O

    A. Jamneshan, O. Shalom, T. Tao, The structure of totally disconnected Host–Kra–Ziegler factors, and the inverse theorem for the U k Gowers uniformity norms on finite abelian groups of bounded torsion , (2023), arXiv:2303.04860. 21The Pythagorean theorem appears in the arXiv p...

    2023 arXiv

  38. [46]

    D. Kim, A. Li, J. Tidor, Cubic Goldreich-Levin, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 4846–4892

    2023

  39. [47]

    Lebesgue

    H. Lebesgue. Sur la repr´esentation trigonom´etrique approch´ee des fonctions satisfaisant `a une condition de Lipschitz, Bull. Soc. Math. France 38 (1910), 184–210

    1910

  40. [48]

    J. M. Lee, Introduction to smooth manifolds, Second edition, Grad. Texts in Math., 218 Springer, New York,

  41. [49]

    J. Leng, A. Sah, M. Sawhney, Quasipolynomial bounds on the inverse theorem for the Gowers U s+1[N ]- norm, (2024), arXiv:2402.17994

    2024 arXiv

  42. [50]

    Manners, Quantitative bounds in the inverse theorem for the Gowers U s+1-norms over cyclic groups , (2018), arXiv:1811.00718

    F. Manners, Quantitative bounds in the inverse theorem for the Gowers U s+1-norms over cyclic groups , (2018), arXiv:1811.00718

    2018 arXiv

  43. [51]

    Mili ´cevi´c, Quantitative inverse theorem for Gowers uniformity norms U 5 and U 6 in Fn 2 , to appear in Canadian Journal of Mathematics

    L. Mili ´cevi´c, Quantitative inverse theorem for Gowers uniformity norms U 5 and U 6 in Fn 2 , to appear in Canadian Journal of Mathematics

  44. [52]

    Mili ´cevi´c, An inverse theorem for certain directional Gowers uniformity norms , Publ

    L. Mili ´cevi´c, An inverse theorem for certain directional Gowers uniformity norms , Publ. Inst. Math. (Beograd) (N.S.) 113(127) (2023), 1–56

    2023

  45. [53]

    Morris, A rapidly-converging lower bound for the joint spectral radius via multiplicative ergodic theory, Adv

    I.D. Morris, A rapidly-converging lower bound for the joint spectral radius via multiplicative ergodic theory, Adv. Math. 225 (2010), no.6, 3425–3445

    2010

  46. [54]

    R¨odl, B

    V . R¨odl, B. Nagle, J. Skokan, M. Schacht, Y . Kohayakawa,The hypergraph regularity method and its appli- cations, Proc. Natl. Acad. Sci. USA. (2005) Jun 7;102(23) pp. 8109–13

    2005

  47. [55]

    Vari´et´es Diff ´erentielles et analytiques by N

    Srinivasacharyulu, K. Vari´et´es Diff ´erentielles et analytiques by N. Bourbaki. Hermann, Paris, 1967. 97 pages., Canad. Math. Bull., 11(3), (1968), 514–514

    1968

  48. [56]

    Szegedy, Higher order fourier analysis as an algebraic theory I, (2009), arXiv:0903.0897

    B. Szegedy, Higher order fourier analysis as an algebraic theory I, (2009), arXiv:0903.0897

    2009 arXiv

  49. [57]

    Szegedy, Higher order fourier analysis as an algebraic theory II, (2009), arXiv:0911.1157

    B. Szegedy, Higher order fourier analysis as an algebraic theory II, (2009), arXiv:0911.1157

    2009 arXiv

  50. [58]

    Szegedy, Higher order fourier analysis as an algebraic theory III, (2010), arXiv:1001.4282

    B. Szegedy, Higher order fourier analysis as an algebraic theory III, (2010), arXiv:1001.4282

    2010 arXiv

  51. [59]

    Szegedy, Limits of kernel operators and the spectral regularity lemma, European J

    B. Szegedy, Limits of kernel operators and the spectral regularity lemma, European J. of Comb.32 (7) (2011), 1156–1167

    2011

  52. [60]

    Szemer ´edi, On sets of integers containing no k elements in arithmetic progression, Acta Arith

    E. Szemer ´edi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199–245

    1975

  53. [61]

    Szemer ´edi, Regular partitions of graphs, Probl`emes combinatoires et th´eorie des graphes (Colloq

    E. Szemer ´edi, Regular partitions of graphs, Probl`emes combinatoires et th´eorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 399–401 Colloq. Internat. CNRS,260, (1978)

    1978

  54. [62]

    Tao, A quantitative ergodic theory proof of Szemer ´edi’s theorem, Electron

    T. Tao, A quantitative ergodic theory proof of Szemer ´edi’s theorem, Electron. J. Combin. 13 (2006), no. 1, Research Paper 99, 49 pp

    2006

  55. [63]

    Tao, A variant of the hypergraph removal lemma, J

    T. Tao, A variant of the hypergraph removal lemma, J. Combin. Theory Ser. A, 113 (7), pp. 1257–1280

  56. [64]

    T. Tao, V . Vu,Additive combinatorics, Cambridge Stud. Adv. Math., 105 Cambridge University Press, Cam- bridge, 2010. xviii+512 pp

    2010

  57. [65]

    T. Tao, T. Ziegler, The inverse conjecture for the Gowers norm over finite fields via the correspondence principle, Anal. PDE 3 (2010), no. 1, 1–20

    2010

  58. [66]

    T. Tao, T. Ziegler, The inverse conjecture for the Gowers norm over finite fields in low characteristic , Ann. Comb. 16 (2012), 121-188

    2012

  59. [67]

    L. N. Trefethen, M. Embree, Spectra and pseudospectra. The behavior of nonnormal matrices and operators Princeton University Press, Princeton, NJ, 2005. xviii+606 pp

    2005

  60. [68]

    Trevisan, Additive combinatorics and theoretical computer science , ACM SIGACT News (2) 40 (2009), 50–66

    L. Trevisan, Additive combinatorics and theoretical computer science , ACM SIGACT News (2) 40 (2009), 50–66

    2009

  61. [69]

    Tulsiani, J

    M. Tulsiani, J. Wolf, Quadratic Goldreich–Levin Theorems, SIAM J. Comput. 43 (2014), no. 2, 730–766

    2014

  62. [70]

    Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science, Camb

    R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science, Camb. Ser. Stat. Probab. Math., 47 Cambridge University Press, Cambridge, 2018. xiv+284 pp

    2018

  63. [71]

    Ziegler, Universal Characteristic Factors and Furstenberg Averages, J

    T. Ziegler, Universal Characteristic Factors and Furstenberg Averages, J. Amer. Math. Soc.20 (2007), 53-97. INSTITUTO DE CIENCIAS MATEM ´ATICAS , C ALLE NICOL ´AS CABRERA 13-15, M ADRID 28049, S PAIN Email address: pablo.candela@icmat.es HUN-REN A LFR ´ED R ´ENYI INSTITUTE OF ...

    2007

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.