Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

HI-DIM COMBINATORICS

Financiado

Cerrado

High dimensional combinatorics

This research program originates from a pressing practical need and from a purely new geometric perspective of discrete mathematics.. Graphs play a key role in many application areas of mathematics, providing the perfect mathemati... ver más

30/09/2018

THE HEBREW UNIVERS...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

THE HEBREW UNIVERSITY OF JERUSALEM No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo FP7 notifico la concesión del proyecto el día 2018-09-30 No tenemos la información de la convocatoria

0% 100% 100%

Características del participante

Este proyecto no cuenta con búsquedas de partenariado abiertas en este momento.

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

THE HEBREW UNIVERSITY OF JER...

0.00€ | Lider

Conecta tu I+D

¿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

Líder del proyecto

THE HEBREW UNIVERSITY OF JERUSALEM No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto This research program originates from a pressing practical need and from a purely new geometric perspective of discrete mathematics.. Graphs play a key role in many application areas of mathematics, providing the perfect mathematical description of all systems that are governed by pairwise interactions, in computer science, economics, biology and more. But graphs cannot fully capture scenarios in which interactions involve more than two agents. Since the theory of hypergraphs is still too under-developed, we resort to geometry and topology, which view a graph as a one-dimensional simplicial complex. I want to develop a combinatorial/geometric/probabilistic theory of higher-dimensional simplicial complexes. Inspired by the great success of random graph theory and its impact on discrete mathematics both theoretical and applied, I intend to develop a theory of random simplicial complexes. This combinatorial/geometric point of view and the novel high-dimensional perspective, shed new light on many fundamental combinatorial objects such as permutations, cycles and trees. We show that they all have high-dimensional analogs whose study leads to new deep mathematical problems. This holds a great promise for real-world applications, in view of the prevalence of such objects in application domains. Even basic aspects of graphs, permutations etc. are much more sophisticated and subtle in high dimensions. E.g., it is a key result that randomly evolving graphs undergo a phase transition and a sudden emergence of a giant component. Computer simulations of the evolution of higher-dimensional simplicial complexes, reveal an even more dramatic phase transition. Yet, we still do not even know what is a higher-dimensional giant component. I also show how to use simplicial complexes (deterministic and random) to construct better error-correcting codes. I suggest a new conceptual approach to the search for high-dimensional expanders, a goal sought by many renowned mathematicians.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores