An Upper Bound Sieve is a sieve method that provides an overestimate for the number of elements remaining in a sifted set by constructing a majorant function, distinguishing itself from lower bound sieves through its use of inequalities that ensure the resulting bound serves as an upper limit in analytic number theory.
6
Publications
267
Citations
9
Authors
6
Institutions
Publications per year
2017–2026
0
Parents
Publications
6
Choice Reviews Online · 2008 · 117 citations
A sieve method for shifted convolution sums
Roman Holowinsky · Duke Mathematical Journal · 2009 · 43 citations
1–5 of 6
Authors
9
- JF
2
h-index
- HIHenryk Iwaniec
Rutgers, The State University of New Jersey, United States
2 publications · 54 citations
2
h-index
- EB
1
h-index
- RH
1
h-index
- JL
1
h-index
1–5 of 9
Institutions
6
Institute for Advanced Study
Princeton, United States
2 h-index
4 publications
112 citations
The Scarborough Hospital
Toronto, Canada
2 h-index
4 publications
112 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
4 publications
112 citations
University of Toronto
Toronto, Canada
1 h-index
1 publications
43 citations
Polish Academy of Sciences
Warsaw, Poland
1 h-index
1 publications
19 citations
University of California, Los Angeles
Los Angeles, United States
1 h-index
1 publications
32 citations
1–6 of 6
Venues
- Journal of the American Mathematical Society
JAMS · 2 publications · 56 citations
2
h-index
- Journal of the Australian Mathematical Society
1 publications · 32 citations
1
h-index
- Choice Reviews Online
CRO · 1 publications · 117 citations
1
h-index
- Indagationes Mathematicae (Proceedings)
1 publications · 19 citations
1
h-index
- Duke Mathematical Journal
DMJ · 1 publications · 43 citations
1
h-index
1–5