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 co...
ver más
¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video
Proyectos interesantes
HIEXP
High Dimensional Expanders Ramanujan Complexes and Codes
2M€
Cerrado
FIDAGG
FINITE DIMENSIONAL APPROXIMATIONS OF GRAPHS GROUPS AND ALG...
241K€
Cerrado
SREACEP
Sparse Robust Expander with Applications in Combinatorial Em...
183K€
Cerrado
ESCSSE
Embedding Sparse Combinatorial Structures using Sublinear Ex...
159K€
Cerrado
ExtSpGraphLim
Extremal Sparse Graphs and Graph Limits
134K€
Cerrado
GeoScape
From Geometry to Combinatorics and Back Escaping the Curse...
2M€
Cerrado
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
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.