Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS

Descriptive Complexity in the Finite and Infinite

Project description

Connecting finite and infinite structures in complexity theory

Infinite structures, such as Borel and measurable graphs, are essential in mathematics and computer science because they help model and analyse complex systems that go beyond finite limitations, such as infinite networks or processes. However, their behaviour often differs significantly from finite structures, hindering understanding of their properties and applications. The ERC-funded DEFINE project will investigate these differences. The research will focus on three key areas: determining the complexity of solving constraint satisfaction problems (CSPs) on infinite domains, analysing the concept of Borel hyperfiniteness in graphs and identifying exceptions, and adapting ideas from set theory to distributed computing models. The goal is to deepen understanding of complexity hierarchies arising from CSPs, advance descriptive combinatorics, and build connections between finite and infinite systems.

Objective

We propose to study infinite, definable (Borel, measurable, etc.) graphs and structures and their interplay with finite ones from the perspective of descriptive complexity. Our focus will be on the following three directions:
-Determining the descriptive complexity of constraint satisfaction problems (CSPs), or, equivalently, homomorphism problems on infinite domains.
-Analyzing the concept of Borel hyperfiniteness of graphs and establishing new examples of non-hyperfinite graphs using methods from infinite-dimensional Ramsey theory.
-Developing finitary analogues of the Borel hierarchy from descriptive set theory, constructing generalizations of the LOCAL model of distributed computing, and transferring theorems from descriptive set theory to this context.
Through this research, we will achieve a deeper understanding of complexity hierarchies arising from CSPs, further advance the field of descriptive combinatorics, and transfer techniques between the finite and infinite worlds.

Fields of science (EuroSciVoc)

Keywords

Programme(s)

Topic(s)

Funding Scheme

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

(opens in new window) ERC-2025-COG

See all projects funded under this call

Host institution

EOTVOS LORAND TUDOMANYEGYETEM
Net EU contribution
€ 1 855 274,00
Address
EGYETEM TER 1-3
1053 Budapest
Hungary
Region
Közép-Magyarország Budapest Budapest
Activity type
Higher or Secondary Education Establishments
Links
Total cost
€ 1 855 274,00

Beneficiaries (1)