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

BORCA

Financiado

Borel combinatorics and Approximations

Infinite graphs and their combinatorics model large real-life networks, like the internet, but are also an essential tool to understand mathematical structures that are intrinsically infinite, like the geometry of the Euclidean sp... ver más

30/09/2025

179K€

Presupuesto del proyecto: 179K€

Líder del proyecto

Masarykova univerzita No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Ver 3 Participantes

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2023-04-05

HORIZON-MSCA-2022-PF-01-01: MSCA Postdoctoral Fellowships 2022 ExpectedOutcome:

I+D

Cerrada hace 2 años

0% 100% 100%

3 Participantes

179.48K€ | Lider

THE REGENTS OF THE UNIVERSIT...

LOS ANGELES UCLA SANTA BARBA...

N.D. | Participante

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

DimDyn Dimension and Dynamics 200K€ Cerrado

PID2020-113350GB-I00 ANALISIS ARMONICO, COMBINATORIA Y ARITMETICA 33K€ Cerrado

MTM2017-82166-P COMBINATORIA GEOMETRICA, ALGEBRAICA Y PROBABILISTICA 61K€ Cerrado

PID2019-105011GB-I00 DINAMICA DE OPERADORES 56K€ Cerrado

CNS2023-143893 Ciencias matemáticas 200K€ Cerrado

PID2020-116773GB-I00 LOGICA MATEMATICA 23K€ Cerrado

Duración del proyecto: 29 meses Fecha Inicio: 2023-04-05
Fecha Fin: 2025-09-30

Líder del proyecto

Masarykova univerzita No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 179K€

Descripción del proyecto Infinite graphs and their combinatorics model large real-life networks, like the internet, but are also an essential tool to understand mathematical structures that are intrinsically infinite, like the geometry of the Euclidean spaces. The project concerns research in descriptive set theory and its interactions with measure theory, dynamical systems, graph limits and theoretical computer science through the study of regularity properties of combinatorial problems on infinite graphs. These considerations played a fundamental role in the spectacular results on the circle squaring problem and form a new field, measurable graph theory. In the last years, an explosion of activity has brought new exciting ideas to this field: formal connections with the theory of distributed computing and random processes, the notion of asymptotic dimension from geometric group theory, or a generalization of the determinacy method of Marks. These ideas have already found several groundbreaking applications and are highly promising in gaining new perspectives on old problems. We propose to employ, combine and further develop these methods with particular emphasis on applications to the study of central questions of descriptive set theory, that is, Borel hyperfiniteness, equidecomposition problems, or the abstract classification problem, as well as on finding new links and applications to classical graph theory, in particular, to algorithmic aspects of partition problems on finite graphs. The fellowship will be carried out over 26 months, 14 at UCLA and 12 at MU. The supervisors, Andrew Marks at UCLA and Dan Kráľ at MU, are leading figures in their respective fields of interest, descriptive set theory and combinatorics. Together with the expertise of the fellow, the project promises a unique potential for bridging these fields, solving deep problems in both areas, developing the fellow's research profile and bringing the contemporary trends of descriptive set theory to Central Europe.

Conecta tu I+D

Entra hoy

¿Olvide mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores