PECTA
Extremal Problems in Combinatorics and Their Applications
| Coordinatore | TEL AVIV UNIVERSITY
Organization address
address: RAMAT AVIV contact info |
| Nazionalità Coordinatore | Israel [IL] |
| Totale costo | 100˙000 € |
| EC contributo | 100˙000 € |
| Programma | FP7-PEOPLE
Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | FP7-PEOPLE-2011-CIG |
| Funding Scheme | MC-CIG |
| Anno di inizio | 2012 |
| Periodo (anno-mese-giorno) | 2012-04-01 - 2016-03-31 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
TEL AVIV UNIVERSITY
Organization address
address: RAMAT AVIV contact info |
IL (TEL AVIV) | coordinator | 100˙000.00 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'In this proposal we describe a variety of problems in Extremal Combinatorics which we intend to study. These problems belong to the following two areas:
1. Additive Combinatorics: We intend to investigate different aspects of Green's variant of the classical Removal Lemma from Graph Theory. Besides being a fundamental problem, we have recently shown that certain variants of Green's result have applications in Theoretical Computer Science. We are working on extending this work to more general settings with the hope of resolving several open problems.
2. Quasi-Randomness: The theory of Quasi-Randomness is one of the most interesting ways in which combinatorics interacts with other areas of mathematics. The main goal is to come up with conditions under which deterministic structures behave like random ones. This concept turned out to be extremely useful for tackling a variety of open problems in different areas. We intend to consider several problem related to graphs and hypergraphs and to further extend this theory.'