OurBigBook About$ Donate
 Sign in Sign up

Fourier stability of a linear configuration count

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Linear configuration count
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Suppose a linear configuration count has a Fourier-integral representation with k factors. If one has a uniform Fourier bound for the difference between two weights and compatible Lk−1 bounds for each weight, expanding the difference one factor at a time and applying Hölder's inequality bounds the change in the count.

 Ancestors (6)

  1. Linear configuration count
  2. Additive combinatorics
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 117 / 4 / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook