Computer Science/Discrete Mathematics Seminar II

Originally number theoretic methods were used to construct optimal (explicit) expanders. Recently combinatorial methods have been utalized in proving that certain number theoretic graphs are expanders. We will explain some uses of such expanders in number theory and give applications such as to sieving.