Comparteix:

Activitats

Comparteix:

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

Quan?

20/05/2016 des de 15:00 (Europe/Madrid / UTC200)

On?

Aula B1, Facultat de Matemàtiques-Edifici Històric (UB) , Gran Via de Les Corts Catalanes, 585, Barcelona 08007

Afegiu l'esdeveniment al calendari

iCal

Seminari de Geometria Algebraica UPC-UB, Link
Ana Cristina López Martín (Universidad de Salamanca)
Equivalencias derivadas y fibras de Kodaira, Link

Comparteix:

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.

Quan?

20/05/2016 fins a 21/05/2016 (Europe/Madrid / UTC200)

On?

FME

Afegiu l'esdeveniment al calendari

iCal

Més informació a Link

Comparteix:

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.

  • Computational geometry seminar 19-05-2016
  • 2016-05-19T13:15:00+02:00
  • 2016-05-19T14:15:00+02:00
  • 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.
Quan?

19/05/2016 de 13:15 a 14:15 (Europe/Madrid / UTC200)

On?

Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)

Afegiu l'esdeveniment al calendari

iCal

Activities are regularly announced at Link

Comparteix:

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)

  • Remainder: Computational geometry seminar 19-05-2016
  • 2016-05-19T13:15:00+02:00
  • 2016-05-19T14:15:00+02:00
  • 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)
Quan?

19/05/2016 de 13:15 a 14:15 (Europe/Madrid / UTC200)

On?

Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)

Afegiu l'esdeveniment al calendari

iCal

Abstract: 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 Erd\H{o}s and Spencer on the existence of rainbow matchings in the complete bipartite graph $K_{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.

Activities are regularly announced at http://www-ma2.upc.edu/dccg/upc-seminar-on-computational-geometry

Comparteix:

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

Quan?

18/05/2016 des de 10:30 (Europe/Madrid / UTC200)

On?

Seminari de l'EPSEM de Manresa

Afegiu l'esdeveniment al calendari

iCal

Comparteix:

Conferè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

Quan?

15/05/2016 des de 18:30 (Europe/Madrid / UTC200)

On?

Biblioteca Joan Oliva. Plaça de la Vila. Vilanova i la Geltrú

Nom de contacte

Afegiu l'esdeveniment al calendari

iCal

Comparteix:

Seminari de Geometria Algebraica UPC-UB: Vladimir Dotsenko

Vladimir Dotsenko (Trinity College Dublin) Combinatorics of associativity, toric varieties and wonderful models

Quan?

13/05/2016 de 15:00 a 20:00 (Europe/Madrid / UTC200)

On?

Aula B1, Facultat de Matemàtiques-Edifici Històric, Universitat de Barcelona, Gran Via de les Corts Catalanes 585, 08007 Barcelona

Afegiu l'esdeveniment al calendari

iCal

Comparteix:

2nd BGSMAth Junior Meeting

II BGSMAth Junior Meeting, May 13th, Barcelona, Institut d'Estudis Catalans

Quan?

13/05/2016 de 09:00 a 18:00 (Europe/Madrid / UTC200)

Afegiu l'esdeveniment al calendari

iCal

El II BGSMAth Junior Meeting tindrà lloc el proper divendres 13 de maig i està coorganitzat per Azahara de la Torre (UPC), Carlos Domingo (UB), Isabel Serra (UAB, CRM)

http://www.bgsmath.cat/ii-bgsmath-junior-meeting/

Comparteix:

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.

  • Computational geometry seminar
  • 2016-05-12T13:15:00+02:00
  • 2016-05-12T14:15:00+02:00
  • 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.
Quan?

12/05/2016 de 13:15 a 14:15 (Europe/Madrid / UTC200)

On?

Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)

Afegiu l'esdeveniment al calendari

iCal

Comparteix:

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.

  • Reminder: Computational geometry seminar 12-05-2016
  • 2016-05-12T13:15:00+02:00
  • 2016-05-12T14:15:00+02:00
  • 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.
Quan?

12/05/2016 de 13:15 a 14:15 (Europe/Madrid / UTC200)

On?

Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)

Afegiu l'esdeveniment al calendari

iCal

Activities are regularly announced at Link