logo
ProjectEnded

Quasi-Randomness in Extremal Combinatorics

One of 1,906 projects Taiyo tracks in Israel.

Source: EU Funding & Tenders Portal

Combinatorics is an extremely fast growing mathematical discipline. While it started as a collection of isolated problems that were tackled using ad-hoc arguments it has since grown into a mature discipline which both incorporated into it deep tools from other mathematical areas, and has also found applications in other mathematical areas such as Additive Number Theory, Theoretical Computer Scienc

Status
Closed
Sector
Education
Location
Israel
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Quasi-Randomness in Extremal Combinatorics

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “Quasi-Randomness in Extremal Combinatorics” is an infrastructure initiative in the Education sector, located in Israel. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

ended

Taiyo status

Closed

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

Combinatorics is an extremely fast growing mathematical discipline. While it started as a collection of isolated problems that were tackled using ad-hoc arguments it has since grown into a mature discipline which both incorporated into it deep tools from other mathematical areas, and has also found applications in other mathematical areas such as Additive Number Theory, Theoretical Computer Science, Computational Biology and Information Theory. The PI will work on a variety of problems in Extremal Combinatorics which is one of the most active subareas within Combinatorics with spectacular recent developments. A typical problem in this area asks to minimize (or maximize) a certain parameter attached to a discrete structure given several other constrains. One of the most powerful tools used in attacking problems in this area uses the so called Structure vs Randomness phenomenon. This roughly means that any {\em deterministic} object can be partitioned into smaller quasi-random objects, that is, objects that have properties we expect to find in truly random ones. The PI has already made significant contributions in this area and our goal in this proposal is to obtain further results of this caliber by tackling some of the hardest open problems at the forefront of current research. Some of these problems are related to the celebrated Hypergraph and Arithmetic Regularity Lemmas, to Super-saturation problems in Additive Combinatorics and Graph Theory, to problems in Ramsey Theory, as well as to applications of Extremal Combinatorics to problems in Theoretical Computer Science. Another major goal of this proposal is to develop new approaches and techniques for tackling problems in Extremal Combinatorics. The support by means of a 5-year research grant will enable the PI to further establish himself as a leading researcher in Extremal Combinatorics and to build a vibrant research group in Extremal Combinatorics.

Location

Country

Israel

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Education

Article published date

2026-01-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project