* Dates within the next 7 days are marked by a star.
Dr. Nikolay Barashkov (MPI, Leipzig)
Phi^4_3 as a Markov field
* Today * Wednesday 07 January 2026, 10:15, Y346
Random Fields which posses the Markov Property have played an important role in the development of Constructive Field Theory. They are related to their relativistic counterparts through Nelson Reconstruction. In this talk I will describe an attempt to understand the Markov Property of the $\Phi^4_3$ measure in 3 dimensions.
This is joint work with T.Gunaratnam.
Adria Marin Salvador (University of Oxford)
TBA
* Tuesday 13 January 2026, 10:15, M3 (M234)
Prof. Steven Gabriel (University of Maryland, NTNU, and Aalto University)
Solving Supply Chain Equilibrium Problems in Energy and Other Infrastructure Areas using a Difference-of-Convex Functions Algorithm
* Tuesday 13 January 2026, 15:15, M1 (M232)
Further information
We describe a novel application of the difference-of-convex function algorithm (DCA) to a variety of equilibrium problems using the mixed complementarity problem (MCP) format. These problems involve bilinear constraints, i.e., complementarity and can be approximated iteratively via convex subproblems using DCA. We develop the necessary theory to make this possible and showcase how it works on several MCPs in energy and other infrastructure areas such as: the Brazilian natural gas market and water markets.
Daniel Aaltonen
MSc thesis presentation: On analyzing and predicting cervical cancer trends in Finland
Thursday 15 January 2026, 13:15, M237
Prof. Lalitha Vadlamani (IIIT Hyderabad)
Higher Order MDS codes
Monday 19 January 2026, 15:15, M3 (M234)
A code is MDS if it achieves the Singleton bound with equality. A code is said to be MDS of order 'l', denoted as MDS(l), if any 'l' subspaces, each of which is obtained by picking columns of the generator matrix of the code, intersect as minimally as possible. Conventional MDS codes are MDS(2) codes. In this talk, we will formally define these codes and study their properties. Interestingly, higher order MDS codes have connections to two classes of codes arising in very different contexts - one class of codes in maximally recoverable codes with product topologies and the second is list decodable codes which are optimal with respect to generalized Singleton bound. We will delve into these connections too as part of this talk.
ANTA Seminar / Hollanti et al.
Kai Hippi (Aalto University)
TBA
Tuesday 20 January 2026, 10:15, M3 (M234)
Joonas Vättö (Aalto University)
TBA
Tuesday 27 January 2026, 10:15, M3 (M234)
Prof. Andrea Pinamonti (Università di Trento)
TBA
Wednesday 04 February 2026, 10:15, M3 (M234)
Seminar on analysis and geometry
Nivedita (University of Oxford)
TBA
Tuesday 10 February 2026, 10:15, M3 (M234)
Prof. Anders Hansen (University of Cambridge)
TBA
Tuesday 10 February 2026, 15:15, M1 (M232)
Dr. Lucas Hataishi (University of Oxford)
TBA
Tuesday 17 February 2026, 10:15, M3 (M234)
Romain Usciati (Paris-Saclay)
TBA
Tuesday 24 February 2026, 10:15, M3 (M234)
Dr. John Urschel (MIT)
TBA
Tuesday 10 March 2026, 15:15, U5 (U147)
Show the events of the past year
Page content by: webmaster-math [at] list [dot] aalto [dot] fi