Title: What is high dimensional combinatorics?
Speaker: Professor Nathan Linial
School of Computer Science and Engineering, the Hebrew University of Jerusalem
"Geometric ideas have been playing a constantly growing role
combinatorics. One of Avner Magen's biggest scientific loves
was to observe the
harmony in which combinatorics, geometry and computation
come together. A major
lesson we have been learning in the last decades is that
combinatorics plays a
particularly important role in the realm of high-dimensional
suggests that many fundamental combinatorial objects have
counterparts which should be of interest. The study of these
objects has been a
main theme in my work for a number of years now. In this
talk I will offer you
a glimpse of some of these fascinating objects. I will
concentrate on the
combinatorial/probabilistic study of simplicial complexes -
These are the higher-dimensional counterparts of graphs. If time permits I
will also say a
few words about the higher-dimensional analogs of permutations.
I have many excellent collaborators on this journey,
including Roy Meshulam,
Lior Aronshtam, Tomasz Lucack, Mishael Rosenthal, Tahl
Nowik, and Zur Luria."
Brief speaker biography: Professor Linial was born in 1953 in Haifa, Israel. He graduated the Technion 1973 in mathematics. He did his military service 1974-1979. In parallel with his military service he also did his PhD in mathematics at the Hebrew University on "Packing and Covering Problems in Graph Theory". His thesis adviser was Micha Perles. He did his postdoctoral studies at UCLA's mathematics department 1980-81. Following that period he returned to Israel and took a position at the Hebrew University's newly established Computer Science department which has been his academic home since then. Professor Linial has visited many research institutions and academic departments throughout the years: IBM Research, Stanford U., Microsoft Research, University of Washington are some of the places where he spent extended visiting periods. His research interests are broad and include several areas of mathematics, computer science and anything in between. He works mostly in combinatorics with a strong emphasis on the geometric side of the field. He is very interested in the foundations of computer science and the resulting mathematical challenges. In the more applied domains he works in bioinformatics and in machine learning. Among his main achievements in research: The introduction of harmonic analysis into the modern study of boolean functions; The study of metric spaces as a tool in algorithms design; New approaches to the construction of expander graphs; The notion of influence of variables; The study of locality in graph theory and in distributed computing; Several contributions to the field of proteins structure; The introduction of metrical task systems. He was blessed with many excellent graduate students (about 30 altogether). His favorite nonscientific activities are: Long distance running (with about 20 marathons so far). Long hikes. Listening to classical music. Reading. He is married to Michal Linial, a biology professor with whom he does most of his work in bioinformatics. They have three children who are (in this order) an artist, a poet and a budding physicist. Some academic trivia: According to DBLP he wrote 144 papers. His Erdos number is 1 (He wrote two joint papers with him).
For Additional Information: Contact Toni Pitassi.