Departament de Matemàtiques

Comparteix:

Activitats

Barcelona Analysis Conference 2016
05/09/2016 fins a 09/09/2016 — Edifici Central de la Universitat de Barcelona. Facultat de Matemàtiques de la UB., —

El congrés està organitzat pel Seminari d'Anàlisi de Barcelona que engloba els grups de recerca en anàlisi matemàtica pertanyents a la UB, UAB i UPC.

Lectura de tesi doctoral: Maribel Anaya
15/07/2016 des de 12:00 — Aula 212, Edifici C2, Campus Nord, UPC, —

Título: Design and validation of structural health monitoring system based on bio-inspired algotithms. Autor: ANAYA VEJAR, MARIBEL. Programa: INGENIERÍA SÍSMICA Y DINÁMICA ESTRUCTURAL. Departamento: Departamento de Ingeniería Civil y Ambiental (ECA). Fecha de lectura: 15/07/2016. Hora de lectura: 12:00. Lugar de lectura: Building C2. Classroom 212, C/Jordi Girona, 1-3, Campus Nord UPC 08034 Barcelona. Director de tesis: POZO MONTERO, FRANCESC (Matemàtiques) | TIBADUIZA, DIEGO ALEXANDER (Universidad Santo Tomás, Colombia).

Computational geometry seminar: Christian Rubio-Montiel
14/07/2016 de 11:15 a 12:15 — Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2), —

Title: The diachromatic number and its homomorphisms Speaker: Christian Rubio-Montiel Comenius University in Bratislava Abstract: We will introduce the diachromatic number, which is a generalization of the achromatic number, and the concept of dihomomorphism. We will prove an interpolation theorem and some relations type Nordhaus-Gaddum.

Propera defensa Pla de Recerca: Jordi Montserrat-Adell
01/07/2016 des de 12:00 —

Us informem de la propera defensa del pla de recerca: A Contribution to Consensus Modeling in Decision-Making by means of Linguistic Assessments. Estudiant: Jordi Montserrat-Adell. Directors: Monica Sanchez i Nuria Agell Programa de doctorat en Matemàtica Aplicada

Computational geometry seminar: Pablo Pérez-Lantero
29/06/2016 de 13:00 a 14:00 — Room 028a, C4 Building, Castelldefels Campus UPC, —

Given a convex polygon of n sides, one can draw n disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the n disks and two disks are adjacent if and only if they have a point in common. We prove that for every convex polygon this graph is planar.