Activitats Passades

19/05/2016 de 13:15 a 14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2),
Speaker: Pilar Cano - Universitat Politècnica de Catalunya and Carleton University A rainbow matching in an edge colored hypergraph is a matching such that each pair of its edges have distinct colors. Brualdi, Ryser and Stein conjectured the existence of a partial n-1 Latin transversal in a Latin square n-matrix. This problem can be translated into finding a rainbow matching in a complete bipartite graph. We extend the result of Erds and Spencer on the existence of rainbow matchings in the complete bipartite graph {n,n} to complete r-partite r-uniform graphs, complete bipartite graphs with repeated edges, and d-regular bipartite graphs minus a matching. The results use the Lopsided version of the Local Lovász Lemma.
19/05/2016 de 13:15 a 14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2),
Title: Rainbow matchings in $r$-partite graph structures Speaker: Pilar Cano Universitat Politècnica de Catalunya and Carleton University (Canadá) Thursday, May 19, 2016, 13:15-14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
18/05/2016 des de 10:30 Seminari de l'EPSEM de Manresa,
Estudi i caracterització de solucions per a jocs cooperatius i bicooperatius. Directors: M. Albina Puente del Campo i José Miguel Giménez Padrales dins del Programa de doctorat en Matemàtica Aplicada
15/05/2016 des de 18:30 Biblioteca Joan Oliva. Plaça de la Vila. Vilanova i la Geltrú,
Breu viatge pel món de les proporcions i la geometria, es mostra la matemàtica i l'art com una relació necessària
13/05/2016 de 15:00 a 20:00 Aula B1, Facultat de Matemàtiques-Edifici Històric, Universitat de Barcelona, Gran Via de les Corts Catalanes 585, 08007 Barcelona,
Vladimir Dotsenko (Trinity College Dublin) Combinatorics of associativity, toric varieties and wonderful models
12/05/2016 de 13:15 a 14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2),
Title: Illuminating polygons using edge-aligned vertex floodlights Speaker: Carlos Alegría-Galicia, Universidad Nacional Autónoma de México (UNAM) Abstract: Consider a simple polygon P with n vertices, a set of n floodlights, and an angle alpha such that, on every vertex of P lies the apex of one floodlight, all the floodlights have aperture alpha, and at least one of the bounding rays of each floodlight is aligned with an edge of P. We study the problem of finding the minimum value of alpha required to cover P. This is a joint work with David Orden, Carlos Seara, and Jorge Urrutia.
12/05/2016 de 13:15 a 14:15 Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2),
Illuminating polygons using edge-aligned vertex floodlights Consider a simple polygon P with n vertices, a set of n floodlights, and an angle alpha such that, on every vertex of P lies the apex of one floodlight, all the floodlights have aperture alpha, and at least one of the bounding rays of each floodlight is aligned with an edge of P. We study the problem of finding the minimum value of alpha required to cover P. This is a joint work with David Orden, Carlos Seara, and Jorge Urrutia.