Lower Bound Sieve
A Lower Bound Sieve is a combinatorial sieve method that provides a lower estimate for the size of a sifted set of integers by constructing a sequence of weights that minimize overcounting while satisfying certain local density conditions.
4
Publications
256
Citations
10
Authors
7
Institutions
Publications per year
2017–2026
0
Parents
4
Choice Reviews Online · 2008 · 117 citations
A new sieve for distinct coordinate counting
JiYou Li, Daqing Wan · Science China Mathematics · 2010 · 53 citations
The proportion of fixed-point-free elements of a transitive permutation group
Nigel Boston, Walter Dabrowski, Tuval Foguel et al. · Communications in Algebra · 1993 · 43 citations
A sieve method for shifted convolution sums
Roman Holowinsky · Duke Mathematical Journal · 2009 · 43 citations
1–4 of 4
10
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 10
7
University of Illinois Urbana-Champaign
Urbana, United States
1 h-index
6 publications
258 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
53 citations

Park University
Parkville, United States
1 h-index
1 publications
43 citations
University of California System
Oakland, United States
1 h-index
1 publications
53 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
43 citations

Shanghai Jiao Tong University
Shanghai, China
1 h-index
1 publications
53 citations

Saint Louis University
St Louis, United States
1 h-index
1 publications
43 citations
1–7 of 7
CRO · 1 publications · 117 citations
1
h-index
DMJ · 1 publications · 43 citations
1
h-index
1 publications · 53 citations
1
h-index
1 publications · 43 citations
1
h-index
1–4