Departament de Matemàtiques

Comparteix:

Esdeveniments del dia Dijous, 15. Juny 2017

Esdeveniments del lloc

  • 2017-01-10T00:00:00+01:00
  • 2017-07-07T23:59:59+02:00
Gener

10

Dimarts

10/01/2017 fins a 07/07/2017

The BGSMath announces the advanced courses on Category Theory, p-adic methods for Galois representations and modular forms, Random discrete structures, Algebraic and combinatorial phylogenetics, Interactions of harmonic analysis, combinatorics and number theory and Arithmetic properties of curves of small genus.

  • 2017-05-22T00:00:00+02:00
  • 2017-06-16T23:59:59+02:00
  • FME-UPC
Maig

22

Dilluns

22/05/2017 fins a 16/06/2017

The Barcelona Graduate School of Mathematics offers an intensive advanced graduate course on Random Discrete Structures on May/June 2017. This course will start on 22nd May 2017. The duration is 20 hours distributed along three weeks.

  • 2017-06-12T09:30:00+02:00
  • 2017-06-16T13:00:00+02:00
  • Biblioteca de Matemàtiques, C3, Campus Nord
Juny

12

Dilluns

12/06/2017 a 09:30 fins a 16/06/2017 a 13:00

"Geometric Networks" is a workshop within the project H2020-MSCA-RISE-734922 CONNECT given to Clemens Huemer. Monday 12th of June to Thursday 15th of June, 09:30 to 18:00. Friday 16th of June, 09:30 to 13:00.

  • 2017-06-15T12:15:00+02:00
  • 2017-06-15T13:15:00+02:00
  • Room S215 Omega Building, Campus Nord UPC (equiv.: Room S215 Floor -2)
Juny

15

Dijous

15/06/2017 de 12:15 a 13:15

Computational Geometry Seminar: Non-kissing complexes of gentle quivers de Vincent Pilaud (CNRS & École Polytechnique). Dijous 15 de juny a les 12:15.

  • 2017-06-15T16:00:00+02:00
  • 2017-06-15T18:00:00+02:00
  • Sala de Juntes de la FME
Juny

15

Dijous

15/06/2017 de 16:00 a 18:00

The Discretizable Molecular Distance Geometry Problem (DMDGP) is related to the determination of 3D protein structures using distance information detected by NMR measurements. An atomic order can be defined such that the distances related to each four consecutive atoms are available, implying that the search space of the problem can be represented by a tree. Conformal Geometric Algebra (CGA) can be used to model the search and to deal with the uncertainties in the data.