OurBigBook About$ Donate
 Sign in Sign up

Croot-Sisask almost-periodicity theorem

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Almost period of a function
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
If finite sets A,S in a group satisfy ∣A+S∣≤K∣A∣, then for q≥2 and 0<ϵ<1 there is T⊆S with ∣T∣≥(2K)−O(q/ϵ2)∣S∣ such that every t∈T−T is an Lq almost period of 1A​∗f:
∥τt​(1A​∗f)−1A​∗f∥q​≤ϵ∥1A​∥1​∥f∥q​.
(1)

 Ancestors (6)

  1. Almost period of a function
  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 / 2025 / iii / Paper 129 / 3 / 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