Bohr Sets
Bohr Sets is a mathematical construct in additive combinatorics defined as a subset of a finite abelian group characterized by its proximity to characters of the group within a specified frequency interval, distinguished from other structured sets by its reliance on the dual group's harmonic structure to capture approximate periodicity.
32
Publications
901
Citations
41
Authors
29
Institutions
Publications per year
2017–2026
6
Parents
32
Walther F. Goebel · Proceedings of the National Academy of Sciences · 1963 · 65 citations · Full text
1–5 of 32
41
5
h-index
4
h-index
California State University, Bakersfield, United States
3 publications · 60 citations
3
h-index
Mathematical Institute of the Slovak Academy of Sciences, Slovakia
2 publications · 81 citations
2
h-index
2
h-index
1–5 of 41
29

Universitat Jaume I
Castellon, Spain
5 h-index
7 publications
140 citations
California State University, Bakersfield
Bakersfield, United States
3 h-index
3 publications
60 citations
University of Wisconsin–Madison
Madison, United States
3 h-index
5 publications
201 citations
Wesleyan University
Middletown, United States
2 h-index
2 publications
42 citations
Sabancı Üniversitesi
Istanbul, Türkiye
2 h-index
4 publications
80 citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
2 h-index
4 publications
162 citations

University of York
York, United Kingdom
2 h-index
2 publications
39 citations

University of Central Florida
Orlando, United States
1 h-index
2 publications
94 citations
1–8 of 29
6 publications · 106 citations
6
h-index
2 publications · 60 citations
2
h-index
2 publications · 102 citations
2
h-index
2 publications · 81 citations
2
h-index
1 publications · 36 citations
1
h-index
1–5