============================================================
   Seminário de Teoria da Computação e Combinatória (TCC)

============================================================

Título:      Limits of sequences of combinatorial structures 
             and applications to property testing
            
Palestrante: Carlos Hoppen
             Instituto de Matemática
             Universidade Federal do Rio Grande do Sul

Hora e Data: 14h, sexta-feira, 14 de outubro de 2011

Local:       auditório do NUMEC

Resumo:

We  have 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.

This includes joint work  with Antônio Bastos (UFC), Ricardo
Corrêa  (UFC), Yoshiharu  Kohayakawa  (USP), Carlos  Gustavo
Moreira  (IMPA), Balazs Ráth  (ETH-Zürich) e  Rudini Sampaio
(UFC).