We would like to inform 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.

BARCCSYN is about bringing together researchers from computational, systems and cognitive neuroscience. Our goal is to provide a forum for lively discussion and promote active collaboration between Barcelona-based research groups, especially between theorists and experimentalists.

Please note the following deadlines:

• May 15: Deadline to present a poster or short communication.  
• June 5: Deadline to register (or until all available seats are filled). 

Registration fee: 60 € (includes: documentation package, lunch tickets, and coffee breaks) 

You can find more information and register at:http://www.crm.cat/en/Activities/Curs_2015-2016/Pages/BARCCSYN-2016.aspx 
We hope that this information is of your interest and we hope to see you soon in Barcelona, 

Organisers

• Gemma Huguet (Universitat Politècnica de Catalunya), 
• Roser Nadal (Universitat Autònoma de Barcelona), 
• Vicky Puig (Institut Hospital del Mar d’Investigacions Mèdiques), 
• Alex Roxin (Centre de Recerca Matemàtica) 

John Hogan (University of Bristol): Singularities in planar piecewise smooth systems.

Més informació a http://www.maia.ub.es/ssd.shtml

Data d'inici

09/03/2016 16:00

Lloc

Aula S01, FME, UPC

s informem de la propera lectura de tesi doctoral:
Títol: The variational approach to brittle fracture in materials with anisotropic surface energy and in thin sheets
Doctorand: Bin Li

Directors: Marino Arroyo i Irene Arias 

Dia : 08-03-2016
 Hora : 17:00
Lloc : Sala 002 Modul C1, Campus Nord

http://doctorat.upc.edu/tesi/llistats-de-tesis/tesis-autoritzades-per-lectura

Date: Tuesday March 8th, 2016, 15h
Place: FME-UPC room 101
Title: "Normal subgroups of groups of piecewise projective homeomorphisms of R"
Speaker: Pep Burillo (UPC)

Abstract: In this talk we will explore subgroups of the Lodha-Moore groups G and G_0\. The group G_0 presents many similarities with Thompson's group F, and we will prove that, as it happens with F, its commutator subgroup is simple. This fact has some consequences, namely, that every proper quotient is abelian, or that every finite-index subgroup is normal. In the case of G, is its second commutator subgroup the one which is simple. We will extend these results to the whole family of groups H(A) introduced by Monod in 2012\. This is joint work with Yash Lodha and Lawrence Reeves.

el proper divendres 4 de març de 2016 a les 17h a la Sala d'Actes de l'EUTEIB, Campus Urgell.
(Programa de doctorat en Matemàtica Aplicada)

 Més informació a http://www.maia.ub.es/ssd.shtml

Ens plau convidar-vos a la presentació del llibre del professor Josep Maria Brunat, Matemàtiques Clàssiques que tindrà lloc dimecres 2 de març a les 12h30 a la sala d'actes de la Facultat. 

El llibre, editat dins la Col·lecció FME, té format digital accessible en obert a l’UPCommons, i és una selecció de trenta temes diversos que formen part de la cultura matemàtica general, però que sovint no s’expliquen als estudis de grau.

Adjuntem l'enllaç del llibre: http://hdl.handle.net/2117/83181

Esperem que la publicació sigui del vostre interès i que ens acompanyeu en l'acte de presentació.

Salutacions cordials,

Jaume Franch
Degà de la Facultat de Matemàtiques i Estadística de la UPC 

Abstract

We will discuss the following problem: Suppose we have two directed graphs, G_1 and G_2, with labels in a set of constants A and a set of variables X. Each G_i has an initial vertex and a set of accepting vertices. We want to find a map f from X to A* so that G_1 and G_2 accept the same language once we substitute each x in X by f(x).

http://www.grupsbcn.cat/](http://www.grupsbcn.cat/

Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor Speaker:**Matias Korman Tokuyama Laboratory, Tohoku University (Japan)
http://www.dais.is.tohoku.ac.jp/~mati/

Abstract: For a polygonal domain of h holes with a total of n vertices, we present algorithms that compute the L1 geodesic diameter in O(n^2+h^4) time and the L1 geodesic center in O((n^4+n2 h^4)α(n)) time, where α(·) denotes the inverse Ackermann function. No algorithms were known for these problems before. For the Euclidean counterpart, the best algorithms compute the geodesic diameter in O(n^7.73) or O(n^7(h + log n)) time, and compute the geodesic center in O(n^12+ε) time. Therefore, our algorithms are much faster than the algorithms for the Euclidean problems. Our algorithms are based on several interesting observations on L1 shortest paths in polygonal domains. 

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