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.
Field of science
- /natural sciences/mathematics/pure mathematics
Call for proposal
See other projects for this call