Geometric extremum problems; that is, looking for minimal and maximal values of a geometric quantity and configurations for which they are attained, have been in the focus of mathematical research since ancient Greece. Examples of such problems are all packing and covering problems, the long list of variants of the isoperimetric inequality and many other related inequalities in convex geometry, or problems in geometric graph theory and combinatorial geometry. Usually these problems have many applications in science from physics and engineering to computer science to medical sciences, and sometimes are even motivated by a real world phenomenon.
The aim of the PhD research is to deal with geometric extremum problems, or problems related to extremum problems. This work may have many different aspects depending on the knowledge, expertise and interest of the applicant. Among other things, it may include mathematical research on convex, discrete or combinatorial geometry problems, on the algorithmic or numeric aspects of these problems, or their applications.
előírt nyelvtudás: angol további elvárások: The topic is geometrically motivated, with special regard to convex, discrete and combinatorial geometry. In addition to geometry, knowledge of analysis, linear algebra or combinatorics is an asset. People interested in programming and numeric comput
felvehető hallgatók száma: 1
Jelentkezési határidő: 2018-05-31
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Bejelentkezés
