|COMPUTER SCIENCE/DISCRETE MATH II|
|Topic:||Expanders in Number Theory|
|Affiliation:||Princeton University and Member, School of Mathematics|
|Date:||Tuesday, April 17|
|Time/Room:||11:00am - 1:00pm/S-101|
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.