Opendata, web and dolomites

RanDM TERMINATED

Randomness and pseudorandomness in discrete mathematics

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "RanDM" data sheet

The following table provides information about the project.

Coordinator
THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD 

Organization address
address: WELLINGTON SQUARE UNIVERSITY OFFICES
city: OXFORD
postcode: OX1 2JD
website: www.ox.ac.uk

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country United Kingdom [UK]
 Project website http://www.its.caltech.edu/
 Total cost 1˙106˙719 €
 EC max contribution 1˙106˙719 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2015-STG
 Funding Scheme ERC-STG
 Starting year 2016
 Duration (year-month-day) from 2016-07-01   to  2021-06-30

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD UK (OXFORD) coordinator 1˙106˙719.00

Map

 Project objective

Discrete mathematics has seen enormous advances in the last few years, with solutions being found to a number of famous and long-standing questions, such as the Erdos distinct distance problem and the existence conjecture for combinatorial designs. Much of this progress owes to an increased understanding of random and pseudorandom objects. An entire framework, known as the probabilistic method, has grown around the application of randomness to combinatorial problems, while pseudorandomness is playing an increasingly important role.

In this proposal, we will consider a range of problems, some stemming from the direct study of random and pseudorandom objects and others arising in areas where randomness and pseudorandomness have proved to be of particular importance. We will be particularly concerned with extensions of the regularity method to sparse graphs and improving bounds for a number of classical problems in graph Ramsey theory. These problems are of a fundamental nature and any progress is likely to lead to new techniques with broader scope for application.

 Publications

year authors and title journal last update
List of publications.
2019 David Conlon, Jacob Fox, Benny Sudakov
Books versus triangles at the extremal density
published pages: , ISSN: , DOI:
2020-04-06
2019 David Conlon
The Ramsey number of books
published pages: , ISSN: 2517-5599, DOI: 10.19086/aic.10808
Advances in Combinatorics 2020-04-06
2020 David Conlon, Jacob Fox, Yuval Wigderson
Ramsey numbers of books and quasirandomness
published pages: , ISSN: , DOI:
2020-04-06
2019 David Conlon, Jacob Fox, Benny Sudakov
Short proofs of some extremal results III
published pages: , ISSN: , DOI:
2020-04-06
2018 Conlon, David
Monochromatic combinatorial lines of length three
published pages: , ISSN: , DOI:
2020-04-06
2019 Asaf Shapira, Mykhaylo Tyomkyn
A Ramsey variant of the Brown-Erdos-Sos problem
published pages: , ISSN: , DOI:
2020-04-06
2019 Conlon, David; Janzer, Oliver; Lee, Joonkyung
More on the extremal number of subdivisions
published pages: , ISSN: , DOI:
2020-04-06
2018 Conlon, David; Tidor, Jonathan; Zhao, Yufei
Hypergraph expanders of all uniformities from Cayley graphs
published pages: , ISSN: , DOI:
2020-04-06
2019 Conlon, David; Das, Shagnik; Lee, Joonkyung; Mészáros, Tamás
Ramsey games near the critical threshold
published pages: , ISSN: , DOI:
2020-04-06
2018 Conlon, David; Lee, Joonkyung
Sidorenko\'s conjecture for blow-ups
published pages: , ISSN: , DOI:
2020-04-06
2019 Heckel, Annika
Non-concentration of the chromatic number of a random graph
published pages: , ISSN: , DOI:
2020-04-06
2019 David Conlon, Lior Gishboliner, Yevgeny Levanzov, Asaf Shapira
A new bound for the Brown-Erdos-Sos problem
published pages: , ISSN: , DOI:
2020-04-06
2018 Heckel, Annika
Random triangles in random graphs
published pages: , ISSN: , DOI:
2020-04-06
2017 Heckel, Annika
Sharp concentration of the equitable chromatic number of dense random graphs
published pages: , ISSN: , DOI:
2020-04-06
2019 Nenadov, Rajko; Sudakov, Benny; Tyomkyn, Mykhaylo
Proof of the Brown-ErdH{o}s-S\'os conjecture in groups
published pages: , ISSN: , DOI:
2020-04-06
2017 David Conlon, Jacob Fox, Vojtech Rodl
Hedgehogs are not colour blind
published pages: , ISSN: 2156-3527, DOI:
Journal of Combinatorics 2020-04-06
2018 Elad Aigner-Horev, David Conlon, Hiep Han, Yury Person, Mathias Schacht
Quasirandomness in hypergraphs
published pages: , ISSN: 1077-8926, DOI:
Electronic Journal of Combinatorics 2020-04-06
2018 DAVID CONLON, JACOB FOX, BENNY SUDAKOV
Hereditary quasirandomness without regularity
published pages: 385-399, ISSN: 0305-0041, DOI: 10.1017/S0305004116001055
Mathematical Proceedings of the Cambridge Philosophical Society 164/03 2020-04-06
2019 Conlon, David; Fox, Jacob; Grinshpun, Andrey; He, Xiaoyu
Online Ramsey Numbers and the Subgraph Query Problem
published pages: , ISSN: , DOI:
2020-04-06
2019 David Conlon, Jacob Fox
Lines in Euclidean Ramsey Theory
published pages: 218-225, ISSN: 0179-5376, DOI: 10.1007/s00454-018-9980-5
Discrete & Computational Geometry 61/1 2020-04-06
2017 David Conlon, Tim Gowers
Freiman homomorphisms in sparse random sets
published pages: , ISSN: 0033-5606, DOI:
Quarterly Journal of Mathematics 2020-04-06
2017 David Conlon
A sequence of triangle-free pseudorandom graphs
published pages: , ISSN: 0963-5483, DOI:
Combinatorics, Probability and Computing 2020-04-06
2018 Boris Bukh, David Conlon
Rational exponents in extremal graph theory
published pages: , ISSN: 1435-9855, DOI:
Journal of the European Mathematical Society 2020-04-06
2019 Conlon, David; Fox, Jacob; Kwan, Matthew; Sudakov, Benny
Hypergraph cuts above the average
published pages: , ISSN: 0021-2172, DOI:
Israel Journal of Mathematics 2020-04-06
2019 Conlon, David; Kamcev, Nina
Intervals in the Hales-Jewett theorem
published pages: , ISSN: 0195-6698, DOI:
European Journal of Combinatorics 2020-04-06
2019 Conlon, David; Fox, Jacob; Sudakov, Benny
Tower-type bounds for unavoidable patterns in words
published pages: , ISSN: 0002-9947, DOI:
Transactions of the American Mathematical Society 2020-04-06
2019 Conlon, David
Hypergraph expanders from Cayley graphs
published pages: , ISSN: 0021-2172, DOI:
Israel Journal of Mathematics 2020-04-06
2017 David Conlon, Yufei Zhao
Quasirandom Cayley graphs
published pages: , ISSN: 2397-3129, DOI:
Discrete Analysis 2020-04-06
2017 David Conlon, Joonkyung Lee
Finite reflection groups and graph norms
published pages: 130-165, ISSN: 0001-8708, DOI: 10.1016/j.aim.2017.05.009
Advances in Mathematics 315 2020-04-06
2019 Conlon, David; Lee, Joonkyung
On the extremal number of subdivisions
published pages: , ISSN: 1073-7928, DOI:
International Mathematics Research Notices 2020-04-06

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "RANDM" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "RANDM" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

RECON (2019)

Reprogramming Conformation by Fluorination: Exploring New Areas of Chemical Space

Read More  

DISSECT (2020)

DISSECT: Evidence in International Human Rights Adjudication

Read More  

EAST (2020)

Using Evolutionary Algorithms to Understand and Secure Web/Enterprise Systems

Read More