From the fall of 2016, BGSMath offers intensive advanced graduate courses every semester on specialized topics. The duration is 10 to 20 hours distributed along 2 to 3 weeks. Some are in connection with our monthly programs while others stand alone. The courses are organized by BGSMath members and taught by research leaders in the corresponding fields.
FORTHCOMING GRADUATE COURSES
The goal of this course is to provide a comprehensive overview of the main theoretical results and solution algorithms for Ky Fan inequalities, together with a wealth of applications.
Lecturer: Mauro Passacantando (University of Pisa)
An introduction to the Riemann Hypothesis and a panoramic overview of the conjecture.
11 – 14 June 2019. Organiser: Eva Miranda (UPC-BGSMath)
Speakers: Vicente Muñoz (University of Málaga), Ricardo Pérez Marco (CNRS & University of Paris Diderot)
PREVIOUS GRADUATE COURSES
This BGSMath Graduate Course will consist of six two-hours sessions devoted to wavelets and their applications.
New room! Aula T1, Faculty of Mathematics and Computer Science, Univ. of Barcelona
Speakers: Joaquim Bruna (UAB & BGSMath), Josep Maria Mondelo (UAB & BGSMath)
The goal of this 10-hour course is to lay out some of the basic principles and introduce mathematical tools that help understand and analyze machine learning algorithms.
Speaker: Gábor Lugosi, ICREA Research Professor, BGSMath – Universitat Pompeu Fabra.
This BGSMath Graduate Course will consist of five two-hours sessions devoted to Malliavin calculus and its applications.
Speaker: David Nualart, University of Kansas (USA)
This BGSMath Graduate Course will take place on the week of 16 July.
Speaker: Juan Rivera-Letelier (University of Rochester)
Topic: Complex Dynamics and Applications
Two courses: Some stochastic models in eco-evolution, by S. Méléard & Zero sets of random functions, by M. Sodin.
The course (9-12 Apr 2018) covers the concept of problem parameterization, explains why and how this induced the definition of the parameterized complexity hierarchy, and provides some links of this theory to the classical complexity theory.
The first goal of this course is to give the students a general idea of the class of problems that benefit from and are amenable to be efficiently solvable by metaheuristics.
*** Please note some last-minute change!***
The course will go from the basics of stochastic processes and combinatorial objects related to phylogenetics to the deep understanding of …
Random methods have become one of the most active and fruitful areas of research in many areas of mathematics, science and engineering, …
The main purpose of this course is to explore several applications of Fourier analytic techniques in number theory and combinatorics, …
The course is an introduction to theoretical and computational aspects of curves of small genus as well as their Jacobians. …
We organize three advanced courses by leading experts in the subject, suitable for PhD students, postdoc researchers and senior number-theorists.
This course is a systematic introduction to modern Category Theory, useful to all students in Algebra, Geometry, Topology, Combinatorics, or Logic.
In this course we will present the basic tools of the subject, with a stress on applications in various areas by means of examples.
In this course we propose a trip through modern infinite group theory with a special emphasis on algorithmic issues.
One of the new directions taken by mathematical logic in the late 20th century was the turn towards substructural or resource-conscious inference [Girard 1987].
The aims of this course are to review the fundamental principles and methods of information theory.
This course will explore the interplay between quasiconformal geometry and holomorphic dynamics.
REMARK: The course will include a number of laboratory sessions to practice the main topics with SAGE and Magma.
Both Lie groups and line bundles are transversal tools that are used in many mathematical fields. We start from a geometrical point view, …
The course will start with a modern review of the key topics learnt in a first PDE course.
The course will present the classical setting of homology as well as an introduction to the more recent aspects that right now are changing the subject.
Probabilistic methods have a wide range of applications in several areas of mathematics, including analysis, geometry, combinatorics,…
The lectures will be chosen among the following list of topics, according to the interests and backgrounds of the students…