Department of Mathematics and Systems Analysis


Lectures, seminars and dissertations

* Dates within the next 7 days are marked by a star.

Valtteri Lipiäinen, Johan Dinesen, Tuomo Valtonen, Neehar Verma
Course presentations: Applications of Coding Theory to Security
* Today * Thursday 30 May 2024,   12:00,   M2 (M233)
12:00 Valtteri Lipiäinen: CodedPaddedFL and CodedSecAgg: Straggler mitigation and secure aggregation in federated learning. 12:30 Johan Dinesen: McEliece cryptosystem. 13:15 Tuomo Valtonen: Secure distributed matrix multiplication. 13:45 Neehar Verma: Private polynomial computation from Lagrange encoding.
ACTS Course Presentations / Hollanti et al.

Joonas Vättö
Segal axioms for the massless, free boson (midterm review presentation)
* Friday 31 May 2024,   10:15,   M3 (M234)
After a review of the geometric axiomatisation scheme to two-dimensional conformal field theories (CFTs) in the spirit of Kontsevich and Segal, I will explicitly show how to construct the chiral CFT for the free, massless boson on arbitrary compact Riemann surfaces. The construction provides a rich playground for the interplay of distant areas of mathematics (Kähler spaces, C*-algebras, geometric function theory, etc.). Time permitting, I will sketch connections to Teichmüller theory, global analysis, and the Atiyah-Singer index theory.

Patricija Sapokaitė
Midterm review: TBA
* Friday 31 May 2024,   13:15,   M2 (M233)
Algebra and discrete mathematics seminar

Prof. Sueli I. R. Costa (Unicamp, Brazil)
On lattices applied to coding for reliable and secure communications
* Monday 03 June 2024,   13:15,   M2 (M233)
This talk aims to present a general approach to some lattice applications in communications emphasizing topics we have been working on recently as well others of interest. Those are related to spherical codes, index coding, multilevel coding/ decoding, Construction Pi-A from Hurwitz quaternions, twisted embeddings in lattice based cryptography and federated learning.
ANTA Seminar / Hollanti et al.

Philine Schiewe
Optimization - A first look (2x45min)
Thursday 06 June 2024,   14:15,   M2 (M233)
In this seminar, we will revisit various key areas of mathematical optimization. Starting from linear optimization and classical solution approaches exploiting the polyhedral feasible sets, we will continue to mixed-integer linear programming. Here, solution approaches from linear programming can be transferred in the context of cutting-plane and branch-and-bound methods striving towards integral polyhedra. As a special case of mixed-integer linear programs, we consider combinatorial optimization. Classical combinatorial optimization problems contain both polynomially solvable problems such as matchings and minimum spanning trees as well as many famous NP-hard problems such as the traveling salesperson problem and maximum cut. As a second generalization of linear programming, we consider semidefinite optimization. Here, we see how combinatorial optimization problems can be approximated by semidefinite programs and have a look at interior-point-based solution approaches.
ANTA Seminar / Hollanti et al.

Matematiikan kandiseminaari (Bachelor thesis seminar in Math.)
Tuesday 11 June 2024,   09:00,   M3 (M234)
Further information

Okko Makkonen
Midterm review: TBA
Thursday 13 June 2024,   11:15,   M3 (M234)
ANTA Seminar / Hollanti et al.

Matematiikan kandiseminaari (Bachelor thesis seminar in Math.)
Wednesday 19 June 2024,   09:00,   M3 (M234)
Further information

Ryosuke Sato (Chuo University)
Tuesday 25 June 2024,   10:15,   M3 (M234)

Show the events of the past year

Page content by: webmaster-math [at] list [dot] aalto [dot] fi