Font size: Αα Αα Αα hide gadgets
You are here: Posts » 2015 » Ιούλιος » 11 » Ομιλία Γενικού Σεμιναρίου Τμήματος Μαθηματικών ΕΚΠΑ
download post: { pdf }

Ομιλία Γενικού Σεμιναρίου Τμήματος Μαθηματικών ΕΚΠΑ

Published at: 2015-07-11, 08:17

Ομιλητής: Αλέκος Κεχρής, California Institute of Technology (Caltech)

Τίτλος: Descriptive graph combinatorics

Ημερομηνία: Τρίτη 14 Ιουλίου 2015, ώρα 15:00

Τόπος: Αίθουσα Γ31, Τμήμα Μαθηματικών, ΕΚΠΑ


This talk is about a relatively new subject, developed in the last two decades or so, which is at the interface of descriptive set theory and graph theory but also has interesting connections with other areas such as ergodic theory and probability theory. The object of study is the theory of definable graphs, usually Borel or analytic, on Polish spaces and one investigates how combinatorial concepts, such as colorings and matchings, behave under definability constraints, i.e., when they are required to be definable or perhaps well-behaved in the topological or measure theoretic sense.

published by Γραμματεία ΜΠΛΑ,
9 years ago.


You must be logged in to comment.


Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.