Vés al contingut (premeu Retorn)

Resultats de la cerca

1177 elements coincideixen amb el vostre criteri de cerca. Ordena per rellevància · data (més recent primer) · alfabèticament
Filtra els resultats.
Seminari grup ACES: Yuri B. Shtessel
Yuri B. Shtessel: Output tracking in nonminimum phase systems via sliding modes
Ubicat a Activitats
Remainder: 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)
Ubicat a Activitats
Col·loqui de matemàtiques UPC-FME
El 1r col·loqui de matemàtiques UPC-FME tindrà lloc el 14 de juny i serà impartit pel professor Louis Nirenberg, premi Abel 2915.
Ubicat a Activitats
Reminder: 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.
Ubicat a Activitats
CRM: Deadlines BARCSSYN 2016
We remind you that we are organizing the fifth session of the Barcelona Computational, Cognitive and Systems Neuroscience (BARCCSYN 2016), which will be held at the Institut d’Estudis Catalans (Barcelona), on June 16 and 17, 2016.
Ubicat a Activitats
11 Barcelona Weekend in Group Theory
Els propers 20 i 21 de maig tindrà lloc a la FME el 11è Barcelona Weekend in Group Theory, organitzat pel grup de recerca grupsBcn.
Ubicat a 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.
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