Sieves and iteration rules
Abstract/Contents
- Abstract
- A sieve is a type of inclusion-exclusion inequality that comes up when bounding the size of number theoretic sets of interest. We explore iterative rules for improving sieve-theoretic bounds when the sifting dimension is slightly greater than one. We also prove some asymptotic results for a model problem introduced by Selberg, in which we pretend that all primes have the same size, and prove the NP-completeness of a decision variant of standard sieve-theoretic questions.
Description
| Type of resource | text |
|---|---|
| Form | electronic; electronic resource; remote |
| Extent | 1 online resource. |
| Publication date | 2017 |
| Issuance | monographic |
| Language | English |
Creators/Contributors
| Associated with | Brady, Zarathustra Elessar |
|---|---|
| Associated with | Stanford University, Department of Mathematics. |
| Primary advisor | Soundararajan, Kannan, 1973- |
| Thesis advisor | Soundararajan, Kannan, 1973- |
| Thesis advisor | Fox, Jacob, 1984- |
| Thesis advisor | Venkatesh, Akshay, 1981- |
| Thesis advisor | Vondrak, Ján, (Mathematician) |
| Advisor | Fox, Jacob, 1984- |
| Advisor | Venkatesh, Akshay, 1981- |
| Advisor | Vondrak, Ján, (Mathematician) |
Subjects
| Genre | Theses |
|---|
Bibliographic information
| Statement of responsibility | Zarathustra Elessar Brady. |
|---|---|
| Note | Submitted to the Department of Mathematics. |
| Thesis | Thesis (Ph.D.)--Stanford University, 2017. |
| Location | electronic resource |
Access conditions
- Copyright
- © 2017 by Zarathustra Elessar Brady
- License
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...