Activitats
Computational geometry seminar 19-05-2016
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.
VisualitzaRemainder: Computational geometry seminar 19-05-2016
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)
VisualitzaPropera defensa Pla de Recerca: Margarida Domenech
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
VisualitzaConferència: "Matemàtiques i art"
Breu viatge pel món de les proporcions i la geometria, es mostra la matemàtica i l'art com una relació necessària
VisualitzaSeminari de Geometria Algebraica UPC-UB: Vladimir Dotsenko
Vladimir Dotsenko (Trinity College Dublin) Combinatorics of associativity, toric varieties and wonderful models
Visualitza2nd BGSMAth Junior Meeting
II BGSMAth Junior Meeting, May 13th, Barcelona, Institut d'Estudis Catalans
VisualitzaComputational geometry seminar
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.
VisualitzaReminder: Computational geometry seminar 12-05-2016
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.
VisualitzaSeminari de Geometria Algebraica UPC-UB: Antoine Chambert-Loir
Antoine Chambert-Loir (Université Paris-Diderot/Institut de Mathématiques de Jussieu), A non-archimedian Ax-Lindemann theorem
VisualitzaFunction Spaces Workshop
The Function Spaces Workshop which will take place next week in CRM
Visualitza
Comparteix: