OurBigBook About$ Donate
 Sign in Sign up

Lower bound for the size of a Bohr set

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Additive combinatorics Bohr set
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
A Bohr set of rank d and width ρ satisfies
∣B(Γ,ρ)∣≥(8ρ​)d∣G∣.
(1)
The proof partitions each circle coordinate into arcs and applies translation averaging and the pigeonhole principle.

 Ancestors (6)

  1. Bohr set
  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 / 2 / 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