Expander Graphs in Pure and Applied Mathematics
(EXPANDERS)
Start date: Oct 1, 2008,
End date: Sep 30, 2014
PROJECT
FINISHED
Expander graphs are finite graphs which play a fundamental role in many areas of computer science such as: communication networks, algorithms and more. Several areas of deep mathematics have been used in order to give explicit constructions of such graphs e.g. Kazhdan property (T) from representation theory of semisimple Lie groups, Ramanujan conjecture from the theory of automorphic forms and more. In recent years, computer science has started to pay its debt to mathematics: expander graphs are playing an increasing role in several areas of pure mathematics. The goal of the current research plan is to deepen these connections in both directions with special emphasis of the more recent and surprising application of expanders to group theory, the geometry of 3-manifolds and number theory.
Get Access to the 1st Network for European Cooperation
Log In
or
Create an account
to see this content
Details
- 100% € 1 082 504,00
-
FP7-IDEAS-ERC
- Project on CORDIS Platform
- Hani Ben Yehuda
- GIVAT RAM CAMPUS 91904 JERUSALEM (Israel)