Abstract

Elementary properties of polynomials can be very powerful in the study of various combinatorial problems. I will illustrate this fact by describing two general techniques together with some of their applications in Combinatorial Geometry, Additive Number Theory and Graph Theory.

CV

Noga Alon is a Baumritter Professor of Mathematics and Computer Science in Tel Aviv University, Israel. He received his Ph. D. in Mathematics at the Hebrew University of Jerusalem in 1983 and has had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Laboratories, Bellcore and Microsoft Research. He serves on the editorial boards of more than a dozen international technical journals and has given invited lectures in many conferences, including plenary addresses in the 1996 European Congress of Mathematics and in the 2002 International Congress of Mathematicians, and an invited lecture in the 1990 International Congress of Mathematicians. He published more than three hundred research papers, mostly in Combinatorics and in Theoretical Computer Science, and one book. He is a member of the Israel National Academy of Sciences since 1997 and received the Erd

FRIDAY, February 13, 2003
Time: 4:30 P.M.
Location: Wean Hall 7500
Refreshments at 4:00 in Wean Hall 6220.