(Math 302)

From Number Theory to Computer Science via Graph Theory and Algebra

Expanders (and other related graphs) have applications in complexity theory, computer architecture, error-correcting codes, communications networks, and pure mathematics. This seminar is intended for advanced undergraduates and first-year graduate students. We will use

Elementary Number Theory, Group Theory, and Ramanujan Graphs by G. Davidoff, P. Sarnak, and A. Valette, London Mathematical Society Student Text 55, Cambridge University Press, 2003.

The text is supposed to be accessible to undergrads but I'll provide some supplemental background on various topics in linear algebra, graph theory, and group theory as needed.

The course will meet once a week, beginning Sunday Jan. 22 from 6:00 to 7:30 pm, in Reiss 284. It is listed as Math 302-2 and is a 3-credit course.

Please consult the web page on the expanders tutorial expanders for further information. In particular, registration for the class is only by permission of the instructor and the department chair. Elementary Number Theory, Group Theory, and Ramanujan Graphs by G. Davidoff, P. Sarnak, and A. Valette, London Mathematical Society Student Text 55, Cambridge University Press, 2003. The text is supposed to be accessible to undergrads but I'll provide some supplemental background on various topics in linear algebra, graph theory, and group theory as needed. The course will meet once a week, beginning Sunday Jan. 22 from 6:00 to 7:30 pm, in Reiss 284. It is listed as Math 302-2 and is a 3-credit course. Please consult Professor Kainen's Web page http://www.georgetown.edu/faculty/kainen/index.html for further information. In particular, registration for the class is only by permission of the instructor and the department chair.

Back to the classroom page .