IPAM Institute for Pure and Applied Mathematics UCLA NSF
Skip Navigation Links
Main Page
Program Poster PDF
Lodging & Air Travel
Program Participants

Combinatorics: Methods and Applications in Mathematics and Computer Science

September 8 - December 11, 2009


Organizing Committee | Activities | Scientific Overview

Organizing Committee

Noga Alon (Tel Aviv University)
Gil Kalai (Hebrew University, Institute of Mathematics)
Janos Pach (City College of New York, EPFL- Lausanne)
Vera Sos (Renyi Institute of Mathematics)
Angelika Steger (ETH Z├╝rich)
Benjamin Sudakov (University of California, Los Angeles (UCLA))
Terence Tao (University of California, Los Angeles (UCLA), Mathematics)

Back to Top

Activities

There will be an active program of research activities, seminars and workshops throughout the period and core participants will be in residence at IPAM continuously for these fourteen weeks. The program will open with tutorials, and will be punctuated by four major workshops and a culminating workshop at UCLA's Lake Arrowhead Conference Center. Several distinguished senior researchers will be in residence for the entire period. Between the workshops there will be a program of activities involving the long-term and short-term participants, as well as visitors.

A series of seminars will take place between workshops. Here is the Schedule.

Back to Top

Scientific Overview

Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas. It studies discrete objects and their properties. Although it is probably as old as the human ability to count, the field experienced tremendous growth during the last fifty years. This program will focus specifically on several major research topics in modern Discrete Mathematics. These topics include Probabilistic Methods, Extremal Problems for Graphs and Set Systems, Ramsey Theory, Additive Number Theory, Combinatorial Geometry, Discrete Harmonic Analysis and its applications to Combinatorics and Computer Science. We aim to foster interaction between researchers in these rather diverse fields, to discuss recent progress and to communicate new results. We would like also to put an emphasis on the exchange of ideas, approaches and techniques between various areas of Discrete Mathematics and Computer Science and on the identification of new tools from other areas of mathematics which can be used to solve combinatorial problems.

Back to Top

Participation

This long-term program will involve a community of senior and junior researchers. The intent is for participants to learn about a variety of powerful methods in modern Combinatorics and their applications to other areas of mathematics, and to meet a diverse group of people and have an opportunity to form new collaborations. In addition to these activities, there will be opening tutorials, four workshops, and a culminating workshop at Lake Arrowhead.

Full and partial support for long-term participants is available, and those interested are encouraged to fill out an online application at the bottom of this page. Support for individual workshops will also be available, and may be applied for through the online application for each workshop. We are especially interested in applicants who are interested in becoming core participants and participating in the entire program (September 8 - December 11, 2009), but give consideration to applications for shorter periods. Funding for participants is available at all academic levels, though recent PhD's, graduate students, and researchers in the early stages of their career are especially encouraged to apply.

Encouraging the careers of women and minority mathematicians and scientists is an important component of IPAM's mission and we welcome their applications.

Back to Top

Back to Top

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CMA2009
460 Portola Plaza
Los Angeles CA 90095-7121
Phone: 310 825-4755
Fax: 310 825-4756
Email: ipam@ucla.edu
Website: http://www.ipam.ucla.edu/programs/cma2009/

Back to Top

NSF Math Institutes   |   Webmaster