DISCRETECONT

From discrete to contimuous: understanding discrete structures through continuous approximation

 Coordinatore EOTVOS LORAND TUDOMANYEGYETEM 

Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie.

 Nazionalità Coordinatore Hungary [HU]
 Totale costo 739˙671 €
 EC contributo 739˙671 €
 Programma FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
 Code Call ERC-2008-AdG
 Funding Scheme ERC-AG
 Anno di inizio 2009
 Periodo (anno-mese-giorno) 2009-01-01   -   2014-06-30

 Partecipanti

# participant  country  role  EC contrib. [€] 
1    EOTVOS LORAND TUDOMANYEGYETEM

 Organization address address: EGYETEM TER 1-3
city: BUDAPEST
postcode: 1053

contact info
Titolo: Dr.
Nome: Katalin
Cognome: Juhászné Huszty
Email: send email
Telefono: 3614116736
Fax: 3614116731

HU (BUDAPEST) hostInstitution 739˙671.00
2    EOTVOS LORAND TUDOMANYEGYETEM

 Organization address address: EGYETEM TER 1-3
city: BUDAPEST
postcode: 1053

contact info
Titolo: Prof.
Nome: László
Cognome: Lovász
Email: send email
Telefono: 3613812202
Fax: 3613812174

HU (BUDAPEST) hostInstitution 739˙671.00

Mappa


 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

graph    mathematics    sequences    discrete    graphs    geometric    representations    theory   

 Obiettivo del progetto (Objective)

'Important methods and results in discrete mathematics arise from the interaction between discrete mathematics and ``continuous' areas like analysis or geometry. Classical examples of this include topological methods, linear and semidefinite optimization generating functions and more. More recent areas stressing this connection are the theory of limit objects of growing sequences of finite structures (graphs, hypergraphs, sequences), differential equations on networks, geometric representations of graphs. Perhaps most promising is the study of limits of growing graph and hypergraph sequences. In resent work by the Proposer and his collaborators, this area has found highly nontrivial connections with extremal graph theory, the theory of property testing in computer science, to additive number theory, the theory of random graphs, and measure theory as well as geometric representations of graphs. This proposal's goal is to explore these interactions, with the participation of a number of researchers from different areas of mathematics.'

Altri progetti dello stesso programma (FP7-IDEAS-ERC)

GUTDROSO (2009)

Gut immunity and homeostasis in Drosophila

Read More  

ANALYTICAL SOCIOLOGY (2013)

Analytical Sociology: Theoretical Developments and Empirical Research

Read More  

BLAST (2010)

"Eclipsing binary stars as cutting edge laboratories for astrophysics of stellar structure, stellar evolution and planet formation"

Read More