The conference venue and program

This conference is anticipated to commence in the morning on Monday, September 4, and close in the afternoon on Friday, September 8, 2017.



Click here for the conference program (pdf)



The conference will be held at the Institute of Computer Science of the University of Wroc│aw, F. Joliot-Curie 15, 50-383 Wroc│aw. All lectures will take place in Lecture Theater no. 27, Level 0. One can also use entrance no. 25, Level 0 or entrance no. 121, Level 1. The place is marked by C on the map below.

Welcome reception

The Mayor of the City of Wroc│aw invites all participants of the conference to a welcome reception at the Town Hall on Monday, September 4 at 19:00. The Town Hall, Rynek 50, 50-996 Wroc│aw is 25 minutes by walk from the conference venue and about 15 minutes from the Mercure Hotel. The place is marked by R on the attached map.

Conference dinner

The conference dinner will take place on Thursday, September 7 at 19:00. It will be held at the Mercure Hotel Wroc│aw Centrum, plac Dominika˝ski 1, 50-159 Wroc│aw (the place is marked by D on the map below).

Public lecture

Professor Terence Tao will give a public lecture on Wednesday, September 6 at 17:00. The lecture will take place in Lecture Theater IICDEF at the Faculty of Chemistry of the University of Wroclaw, F. Joliot-Curie 14, 50-383 Wroc│aw. This is 5-10 minutes by walk from the conference venue (the place is marked by P on the map below). There is no registration for the participants of the conference. Details of the talk title and abstract are as follows:


Terence Tao (University of California, Los Angeles)

Title: The Erd§s discrepancy problem.

Abstract: The discrepancy of a sequence \(f(1), f(2), \ldots \) of numbers is defined to be the largest value of \(|f(d) + f(2d) + \ldots + f(nd)|\) as \(n,d\) range over the natural numbers. In the 1930s, Erd\"os posed the question of whether any sequence consisting only of \(+1\) and \(-1\) could have bounded discrepancy. In 2010, the collaborative Polymath5 project showed (among other things) that the problem could be effectively reduced to a problem involving completely multiplicative sequences. Finally, using recent breakthroughs in the asymptotics of completely multiplicative sequences by Matomaki and Radziwill, as well as a surprising application of the Shannon entropy inequalities, the Erd§s discrepancy problem was solved in 2015. In this talk I will discuss this solution and its connection to the Chowla and Elliott conjectures in number theory.