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

Combinatorics: Methods and Applications in Mathematics and Computer Science

Workshop II: Combinatorial Geometry

October 19 - 23, 2009

Organizing Committee | Scientific Overview | Speaker List

Application/Registration | Contact Us

Organizing Committee

Alexander Barvinok (University of Michigan)
Gil Kalai (Hebrew University, Institute of Mathematics)
Janos Pach (Renyi Institute of Mathematics, EPFL- Lausanne)
Jozsef Solymosi (University of British Columbia, Mathematics)
Emo Welzl (ETH Zürich, Theoretical Computer Science)

Back to Top

Scientific Overview

Although geometry has been studied for thousands of years, the term of discrete geometry is of quite recent origin. Combinatorial geometry deals with the structure and complexity of discrete geometric objects and is closely related to computational geometry, which deals with the design of efficient computer algorithms for manipulation of these objects. This area is by its nature interdisciplinary and has relations to many other vital mathematical fields and also applications to computer science. The focus of this workshop will be on the study of discrete geometric objects, their combinatorial structure, stressing the connections between discrete geometry and combinatorics, number theory, analysis and computer science.

Specific topics will include extremal problems in combinatorial geometry, results on the number of incidence between points and lines (hyperplanes and etc.), applications of incidence bounds to combinatorial number theory and analysis, Erdos' repeated and distinct distance questions, geometric graph theory and graph drawings, computational geometry, covering and packing problems, Helly type theorems and applications to clustering, convex polytopes, hyperplane arrangements, algebraic and topological methods in discrete geometry, combinatorics of convex sets, application of convex geometry to linear programming and optimizations.

This workshop will include a poster session; a request for posters will be sent to registered participants in advance of the workshop.

Back to Top

Confirmed Speakers

Eric Babson (University of California, Davis (UC Davis))
Keith Ball (University College London)
Imre Barany (Renyi Institute of Mathematics)
Timothy Chan (University of Waterloo)
Jesus De Loera (University of California, Davis (UC Davis))
Richard Ehrenborg (University of Kentucky)
David Eppstein (University of California, Irvine (UCI))
Jacob Fox (Princeton University)
Caroline Klivans (University of Chicago)
Fu Liu (University of California, Davis (UC Davis))
Eran Nevo (Cornell University)
Gabriel Nivasch (ETH Zürich)
Isabella Novik (University of Washington)
Janos Pach (Renyi Institute of Mathematics)
Igor Pak (University of California, Los Angeles (UCLA))
Rom Pinchasi (Technion - Israel Institute of Technology)
Francisco Santos (University of Cantabria)
Jozsef Solymosi (University of British Columbia)
Richard Stanley (Massachusetts Institute of Technology)
Bernd Sturmfels (University of California, Berkeley (UC Berkeley))
Rekha Thomas (University of Washington)
Geza Toth (Renyi Institute of Mathematics)
Frank Vallentin (CWI (Center for Mathematics and Computer Science))
Uli Wagner (ETH Zürich)
Günter Ziegler (Technische Universität Berlin)

Back to Top

Contact Us:

Institute for Pure and Applied Mathematics (IPAM)
Attn: CMAWS2
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/cmaws2/

Back to Top

NSF Math Institutes   |   Webmaster