Geometric functional analysis lies at the interface of convex geometry, functional analysis and probability. It has numerous applications ranging from geometry of numbers and random matrices in pure mathematics to geometric tomography and signal processing in engineering and numerical optimization and learning theory in computer science.
One of the directions of the program is classical convex geometry, with emphasis on connections with geometric tomography, the study of geometric properties of convex bodies based on information about their sections and projections. Methods of harmonic analysis play an important role here. A closely related direction is asymptotic geometric analysis studying geometric properties of high dimensional objects and normed spaces, especially asymptotics of their quantitative parameters as dimension tends to infinity. The main tools here are concentration of measure and related probabilistic results. Ideas developed in geometric functional analysis have led to progress in several areas of applied mathematics and computer science, including compressed sensing and random matrix methods. These applications as well as the problems coming from computer science will be also emphasised in our program.Updated on Aug 23, 2017 03:38 PM PDT
Combinatorics is one of the fastest growing areas in contemporary Mathematics, and much of this growth is due to the connections and interactions with other areas of Mathematics. This program is devoted to the very vibrant and active area of interaction between Combinatorics with Geometry and Topology. That is, we focus on (1) the study of the combinatorial properties or structure of geometric and topological objects and (2) the development of geometric and topological techniques to answer combinatorial problems.
Key examples of geometric objects with intricate combinatorial structure are point configurations and matroids, hyperplane and subspace arrangements, polytopes and polyhedra, lattices, convex bodies, and sphere packings. Examples of topology in action answering combinatorial challenges are the by now classical Lovász’s solution of the Kneser conjecture, which yielded functorial approaches to graph coloring, and the more recent, extensive topological machinery leading to breakthroughs on Tverberg-type problems.Updated on Aug 28, 2017 11:26 AM PDT
Updated on Jan 05, 2017 05:15 PM PST