Effective Random Methods in Discrete Mathematics
This project explores the constructive version of the probabilistic method in combinatorics and cryptography, aiming to enhance measurability, improve Ramsey estimates, analyze extremal graphs, and optimize cryptographic efficiency.
Projectdetails
Introduction
The probabilistic method, pioneered by Paul Erdős, can show the existence of combinatorial objects without hinting how to construct them effectively. Recent developments concerning the constructive version of Lovász Local Lemma (LLL) showed how to modify the probabilistic method to make it effective. This proposal lists four research directions in analysis, combinatorics, and cryptography, where this method opened new possibilities to go beyond our present knowledge.
Research Directions
-
Measurable Version of LLL
The question is whether the object, guaranteed by LLL, can additionally be measurable. In some special cases, the answer is affirmative. We aim to explore:- What are the constraints that guarantee measurability?
- When is it impossible to achieve this?
Results are relevant for classical problems of measure group theory.
-
Improvement of the Sunflower Lemma
A novel approach improving the celebrated sunflower lemma also uses effective probabilistic tools. We will use a similar approach to improve the best estimates for:- Multicolor Ramsey numbers
- Schur numbers
- A number of other classical problems
-
Extremal Graphs with Ordered Vertices or Edges
Several new phenomena arise in extremal graphs when either the vertices or the edges are linearly ordered. To investigate them, we use methods from effective probabilistic sampling. The answers would be relevant in:- Discrete geometry
- Algorithm design
-
Relaxing Requirements in Cryptographic Primitives
An emerging phenomenon in certain cryptographic primitives, including secret sharing, will be addressed. Relaxing the strict requirements of correctness by allowing negligible errors can lead to significant improvements in efficiency. This is a direct consequence of the mostly unknown structure of the boundary of the entropy region. Using tools and results from the other parts of the project, we will explore this boundary, providing hints for why and tools for where and when such efficiency gaps might occur.
Financiële details & Tijdlijn
Financiële details
Subsidiebedrag | € 2.019.035 |
Totale projectbegroting | € 2.019.035 |
Tijdlijn
Startdatum | 1-1-2023 |
Einddatum | 31-12-2027 |
Subsidiejaar | 2023 |
Partners & Locaties
Projectpartners
- HUN-REN RENYI ALFRED MATEMATIKAI KUTATOINTEZETpenvoerder
Land(en)
Vergelijkbare projecten binnen European Research Council
Project | Regeling | Bedrag | Jaar | Actie |
---|---|---|---|---|
Randomness and structure in combinatoricsThe project aims to deepen the understanding of randomness in combinatorics by exploring the relationship between structured and random objects, focusing on Ramsey graphs and design theory. | ERC Starting... | € 1.343.890 | 2023 | Details |
Integrable ProbabilityThis project explores integrable probability by applying advanced mathematical methods to stochastic models, aiming to derive precise limit theorems and enhance understanding of random walks and representations. | ERC Starting... | € 1.083.750 | 2022 | Details |
High Dimensional Probability and CombinatoricsThis project aims to explore random matrices, hypergraph Ramsey numbers, and the Chowla cosine problem using high-dimensional probability and combinatorial methods. | ERC Starting... | € 1.499.408 | 2024 | Details |
Algebraic Formula Lower Bounds and ApplicationsThis project aims to establish lower bounds for algebraic formulas and improve Polynomial Identity Testing algorithms by leveraging structural and algebraic techniques in theoretical computer science. | ERC Consolid... | € 1.869.055 | 2024 | Details |
Concentration and threshold phenomena in random graphs and hypergraphsThis project aims to advance the enumeration of large structures in random graphs and hypergraphs under local constraints, addressing key open problems in combinatorics and probability theory. | ERC Consolid... | € 1.621.875 | 2022 | Details |
Randomness and structure in combinatorics
The project aims to deepen the understanding of randomness in combinatorics by exploring the relationship between structured and random objects, focusing on Ramsey graphs and design theory.
Integrable Probability
This project explores integrable probability by applying advanced mathematical methods to stochastic models, aiming to derive precise limit theorems and enhance understanding of random walks and representations.
High Dimensional Probability and Combinatorics
This project aims to explore random matrices, hypergraph Ramsey numbers, and the Chowla cosine problem using high-dimensional probability and combinatorial methods.
Algebraic Formula Lower Bounds and Applications
This project aims to establish lower bounds for algebraic formulas and improve Polynomial Identity Testing algorithms by leveraging structural and algebraic techniques in theoretical computer science.
Concentration and threshold phenomena in random graphs and hypergraphs
This project aims to advance the enumeration of large structures in random graphs and hypergraphs under local constraints, addressing key open problems in combinatorics and probability theory.