Limits of sequences of combinatorial structures and applications to property testing
| Vortragende(r): |
| Prof. Dr. Carlos Hoppen (Universidade Federal do Rio Grande do Sul, Instituto de Matemática, Porto Alegre, Brasil) |
| Inhalt: |
| We habe developed a theory of convergence of permutation sequences along the lines of the work for graph sequences by Borgs, Chayes, Lovász, Szegedy, Sós and Vesztergombi. This leads to a description of the closure of the set of all permutations as a special class of Lebesgue measurable functions in [0,1]2, which, in analogy with the graph case, gives a model of random permutations and can be connected to property testing and parameter testing for permutations. In this talk, we shall discuss these results and recent developments concerning other combinatorial structures, such as posets with bounded dimension and ordered graphs. |
| Zeiten: |
| Mittwoch, der 07.09.2011, 11:30 - 13:00 Uhr, Raum 1/208a |
