Workshop on Distance Geometry, Semidefinite Programming and Applications
Description
Distance geometry is a research area bridging mathematics and computer science with applicability to practical problems in a wide range of disciplines. In the majority of the applications, we are given an incomplete list of distances between pairs of objects, and we seek positions in Euclidean space realizing those distances. Classical applications include topics as protein conformation determination and sensor network localization, while emerging applications range from the study of molecular nanostructure to the adaptation of human movements in simulated environments. Distance geometry is also used in important data science applications such as compressed sensing, low rank matrix completion, and visualization of high-dimensional data.
Semidefinite programming has been exploited in the solution of many of these problems concerning Euclidean distance, as for example, to construct relaxations for the problems of sensor network localization, metric-space embedding and Euclidean distance matrix completion. Among other important distance geometry applications with connections to semidefinite programming, we highlight the universal and dimensional rigidity and pre-stress stability, which admit close links to semidefinite programming and gram matrices, including connections to low rank matrix completion. Furthermore, the study of coordinate shadows, projections and fibers of the dimensional strata of Euclidean and L_p distance cones provides bridges both to geometric analysis and to algebraic geometry and configuration spaces.
Specifically, they are used in configuration space descriptions using Cayley or distance parameters and a notion called flattenability that is related to generic rigidity and graph forbidden minors.
This workshop aims at highlighting important mathematical and computational challenges in distance geometry, at setting connections to related semidefinite programming problems, and at discussing applications of distance geometry in diverse areas, by gathering leading researchers in the field.
All times are in Toronto local time (Eastern Time)
Schedule
09:00 to 10:00 |
Distinguished Lecture Series: Monique Laurent, Centrum Wiskunde & Informatica |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:30 |
Charles Johnson, College of William and Mary |
11:30 to 13:00 |
Lunch
|
13:00 to 14:00 |
Hugo Woerdeman, Drexel University |
14:00 to 14:15 |
Coffee break
|
14:15 to 15:15 |
No Title Specified
Random Speed Chats / Zoom Breakout Rooms |
09:00 to 10:00 |
Gabor Pataki, UNC Chapel Hill |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:30 |
Leo Liberti, Centre national de la recherche scientifique (CNRS) |
11:30 to 13:00 |
Lunch
|
13:00 to 14:00 |
Fei Wang, The Fields Institute |
09:00 to 10:00 |
Distinguished Lecture Series: Monique Laurent, Centrum Wiskunde & Informatica |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:30 |
Ryoshun Oba, The University of Tokyo |
11:30 to 13:00 |
Lunch
|
13:00 to 13:45 |
Tibor Jordan, ELTE Eotvos University |
09:00 to 10:00 |
Distinguished Lecture Series: Monique Laurent, Centrum Wiskunde & Informatica |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:30 |
Carlile Lavor, UNICAMP |
11:30 to 13:00 |
Lunch
|
13:00 to 13:30 |
Alexander Kolpakov, Université de Neuchâtel |
13:30 to 14:00 |
Karoly Bezdek, University of Calgary |
08:30 to 09:00 |
Contributed Talk by Antonios Varvitsiotis, Singapore University of Technology and Design |
09:00 to 10:00 |
Invited talk by Anthony Man-Cho So, The Chinese University of Hong Kong |
10:00 to 10:30 |
Coffee break
|
10:30 to 11:00 |
Contributed Talk by Siwar Saidani, University of Carthage |
11:00 to 11:30 |
Contributed Talk by Mikhail Kovalev, MSU |
11:30 to 12:00 |
Contributed Talk by Sammy Khalife, LIX, Ecole polytechnique |