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

PEPCo

Financiado

Problems in Extremal and Probabilistic Combinatorics

Extremal and probabilistic combinatorics is a central and currently maybe the most active and fastest growing area in discrete mathematics. The field can be traced back to the work of Turán and it was established by Erdős throug... ver más

30/09/2022

UHAM

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

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

TRL 4-5

Ver 2 Participantes

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2022-09-30

ERC-2016-COG: ERC Consolidator Grant

I+D

Cerrada hace 8 años

0% 100% 100%

Información adicional privada

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

2 Participantes

UHAM

1.80M€ | Lider

MEADWESTVACO CALMAR

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

Proyectos interesantes

ExtComb Extremal Combinatorics existence counting and typical stru... 2M€ Cerrado

MTM2014-54745-P ESTRUCTURAS DISCRETAS, GEOMETRICAS Y ALEATORIAS 84K€ Cerrado

MTM2011-24097 COMBINATORIA, TEORIA DE GRAFOS Y GEOMETRIA DISCRETA 48K€ Cerrado

LocalGlobal Local vs Global Properties of Large Discrete Structures 2M€ Cerrado

RANDSTRUCT Randomness and structure in combinatorics 1M€ Cerrado

MTM2008-03020 ENUMERACION DE ESTRUCTURAS DISCRETAS: METODOS ANALITICOS, PR... 53K€ Cerrado

Duración del proyecto: 67 meses Fecha Inicio: 2017-02-21
Fecha Fin: 2022-09-30

Líder del proyecto

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

TRL 4-5

Presupuesto del proyecto 2M€

Descripción del proyecto Extremal and probabilistic combinatorics is a central and currently maybe the most active and fastest growing area in discrete mathematics. The field can be traced back to the work of Turán and it was established by Erdős through his fundamental contributions and his uncounted guiding questions. Since then it has grown into an important discipline with strong ties to other mathematical areas such as theoretical computer science, number theory, and ergodic theory. The PI proposes a variety of extremal problems for hypergraphs and for sparse random and pseudorandom graphs. The work for hypergraphs is motivated by Turán’s problem, maybe the most prominent open problem in the area. After solving an analogous question for graphs, Turán asked to determine the maximum cardinality of a set E of three-element subsets of a given n-element set V such that for any 4 elements of V at least one triple is missing in E. This innocent looking problem seems to be out of reach by our current methods and despite a great deal of effort over the last 70 years, our knowledge is still very limited. We suggest a variant of the problem by imposing additional restrictions on the distribution of the three-element subsets in E. These additional assumptions yield a finer control over the corresponding extremal problem. In fact, this leads to many interesting and hopefully more manageable subproblems, some of which were already considered by Erdős and Sós. We suggest a unifying framework for these problems and one of the main goals would be the development of new techniques for this type of problems. These additional assumptions on the hyperedge distribution are closely related to the theory of quasirandom discrete structures, which was pioneered by Szemerédi and became a central theme in the field. In fact, the hypergraph extension by Gowers and by Rödl et al. of the regularity lemma provide essential tools for this line of research.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores