RESERVE MY SPOT

Several years ago, David Zmiaikou obtained his Ph.D. degree at the University Paris-Sud (Orsay) under the supervision of Professor Jean-Christophe Yoccoz. After that, he visited the mathematical institute IMPA in Rio de Janeiro thanks to the Balzan research project of Professor Jacob Palis. As a part of David's European Post-Doctoral Institute (EPDI) fellowship, he worked at:

- Erwin Schrödinger Institute for Mathematical Physics, Vienna, Austria;

- Institute for Mathematical Research, Zürich, Switzerland;

- Institut des Hautes Etudes Scientifiques, Bures-sur Yvette, France;

- Max Planck Institute for Mathematics Bonn, Germany.

Then Zmiaikou did postdoctoral research in DNA analysis at the Wellcome Trust Sanger Institute in the United Kingdom.

The main goal of the course is to understand the concept of a graph and the concept of a tree, and to learn different techniques of studying them. This will be very helpful for more advanced courses in combinatorics and computer science, due to the crucial role of graphs in data representation.

SKILLS:

- Algorithms

- Combinatorics

- Data Analysis

- Discrete Optimisation

- Dynamical Systems

- Geometry

- Group Theory

- Software Engineering

- Web Design


DATE: 8 Apr - 26 Apr, 2018

DURATION: 3 Week

LECTURES: 3 Hours per day

LANGUAGE: English

LOCATION: Barcelona, Harbour.Space Campus

COURSE TYPE: Offline

WHAT YOU WILL LEARN
ABOUT DAVID
HARBOUR.SPACE 

The main objects of this course are graphs. Graphs are highly useful and adaptable mathematical structures. They have their origins in many disciplines, and their area of application is even wider — from information theory and engineering to ecology and sociology. The course provides basic terminology, ideas and methods on graphs. Trees (connected acyclic graphs) form a special class that we will study in more detail. We will also introduce combinatorial notions and methods which will allow us to enumerate graphs and trees.

DAVID
ZMIAIKOU

PhD, Lecturer at the Educational Centre of the Belarusian State University

RESERVE MY SPOT

We offer innovative university degrees taught in English by industry leaders from around the world, aimed at giving our students meaningful and creatively satisfying top-level professional futures. We think the future is bright if you make it so.

HARBOUR.SPACE UNIVERSITY

DATE: 8 Apr - 26 Apr, 2018

DURATION: 3 Weeks

LECTURES: 3 Hours per day

LANGUAGE: English

LOCATION: Barcelona, Harbour.Space Campus

COURSE TYPE: Offline

All rights reserved. 2017

Harbour.Space University
Tech Heart
COURSE OUTLINE

Session 1

Binomial Coefficients

Session 2

Permutations

Session 3

Bijective Proofs

SHOW MORE

Session 4

Introduction to Graphs

COMBINATORICS 
& GRAPHS - 1
COMBINATORICS
& GRAPHS - 1
BIBLIOGRAPHY
Problem-Solving Methods in
Combinatorics: An Approach to 
Olympiad Problems by Pablo Soberón
(Birkhäuser, 2013)

Graph Theory, Reinhard Diestel
by Reinhard Diestel
(Springer, 2017)

Proofs from THE BOOK by 
Günter M. Ziegler
(Springer, 2018)