Vés al contingut (premeu Retorn)

Resultats de la cerca

1218 elements coincideixen amb el vostre criteri de cerca. Ordena per rellevància · data (més recent primer) · alfabèticament
Filtra els resultats.
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.
Ubicat a Activitats
2nd BGSMAth Junior Meeting
II BGSMAth Junior Meeting, May 13th, Barcelona, Institut d'Estudis Catalans
Ubicat a Activitats
Propera 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
Ubicat a Activitats
Seminari 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
Ubicat a Activitats
Seminari de Geometria Algebraica UPC-UB: Ana Cristina López Martin
Ana Cristina López Martín (Universidad de Salamanca), Equivalencias derivadas y fibras de Kodaira
Ubicat a Activitats
Computational 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.
Ubicat a Activitats
Seminari de Geometria Algebraica UPC-UB: Vladimir Dotsenko
Vladimir Dotsenko (Trinity College Dublin) Combinatorics of associativity, toric varieties and wonderful models
Ubicat a Activitats
Function Spaces Workshop
The Function Spaces Workshop which will take place next week in CRM
Ubicat a Activitats
Jornada de Recerca
Hi haurà presentacions dels grups de recerca del departament. Inici 9 juny 2016 , 9:00; final 13:00 Ubicació: Sala d'actes FME
Ubicat a Activitats
Reminder CRM Intensive Research Program on Large Cardinals
We would like to remind you about the forthcoming CRM Intensive Research Program on Large Cardinals and Strong Logics, to be held from September 5 to December 16, 2016. The National Science Foundation and the Association for Symbolic Logic offer grants to participate in the program and its scientific events.
Ubicat a Activitats