* Seuraavan viikon tapahtumat merkitty tähdellä
Dr. Olli Järviniemi
Siitä, mitä kutsutaan tilastotieteeksi
* Friday 28 November 2025, 15:00, M2 (M233)
Käsittelen tilastotieteen aiheita, jotka ovat nousseet huomiooni tehdessäni kokeellista tutkimusta tekoälyn parissa. Luennon teemana on, että monet alkuperäiset odotukseni tilastotieteeltä ovat sellaisia, joihin tilastotieteen menetelmien ei ole mahdollista vastata, mikä luo tarpeen erilaiselle orientaatiolle datan analysointiin ja tieteen tekemiseen. Luennossa käsitellään muun muassa seuraavia aiheita: otantajakauman merkitys päätelmien tekemisessä, uskomusten muutos erimielisyyden tiloissa ja yleisluontoisten päätelmien keskeisyys.
Stochastics and Statistics Seminar
Signe Lundqvist (KU Leuven)
Scenes over non-generic pictures of hypergraphs
* Tuesday 02 December 2025, 11:15, M2 (M233)
The central problem in scene analysis is finding the space of d-dimensional polyhedral caps with a fixed projection to (d-1)-dimensional space. In particular, we are interested in which sets of points in (d-1)-dimensional space are the projections of non-trivial polyhedral caps, in the sense that the hyperplanes of the polyhedral cap are distinct.
Given the combinatorial structure of the polyhedral cap, studying the space of d-dimensional polyhedral caps with a fixed generic projection becomes a combinatorial problem. Specifically, liftings of generic projections can be studied via a lifting matrix. Whiteley characterised independence in the row-matroid of the lifting matrix for generic projections. The dual problem to studying scenes over generic projections is the problem of studying the space of parallel redrawings of hyperplane arrangements.
In this talk, we will focus on liftability of non-generic projections, or, dually, parallel redrawings of non-generic hyperplane arrangements. For a class of polyhedral caps, we will see that the set of projections that lift to non-generic polyhedral caps with the correct combinatorial structure is given as the zero-set of a single polynomial, called the pure condition. We will see some basic properties of the pure condition, and how to easily compute it.
The talk will be based on joint work with Daniel Bernstein.
Algebra and discrete mathematics seminar
Tuomas Kelomäki (Aalto University)
Fast and smooth? Khovanov homology and computational complexity
Tuesday 09 December 2025, 10:15, M3 (M234)
At the turn of the century, Khovanov upgraded the Jones polynomial into a homology theory of knots, which is sensitive to smooth structures in 4D. The Jones polynomial can be recovered from Khovanov homology, so Khovanov homology is at least as hard to compute as the Jones polynomial, and it is an open question how much harder it is. In this talk, we will try to explain why mathematicians should care about fast computations of Khovanov homology. We will also explore polynomial and non-polynomial time algorithms for both Jones polynomial and Khovanov homology of braids. Joint work with Dirk Schütz.
Prof. Tuomas Hytönen (Aalto University)
Commutators, finite rank approximation, classical and quantum derivatives
Tuesday 09 December 2025, 15:15, M1 (M232)
Further information
Quantifying the failure of the commutative law ab = ba for objects beyond numbers is key to diverse topics in pure and applied mathematics. This is achieved by studying the properties of the related commutator. Anything that one might wish to feed to a computer is necessarily finite, and hence it is useful to know how well such commutators can be estimated by finite rank approximations. It turns out that the rate of approximation has a sharp threshold that cannot be beaten, while the best possible approximation rate has connections to both classical differentiability and a certain quantum analogue. A general framework for these questions is contained in my recent work with Riikka Korte.
Joonas Vättö (Aalto University)
TBA
Tuesday 16 December 2025, 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.
Prof. Andrea Pinamonti (Università di Trento)
TBA
Wednesday 04 February 2026, 10:15, M3 (M234)
Seminar on analysis and geometry
Prof. Anders Hansen (University of Cambridge)
TBA
Tuesday 10 February 2026, 15:15, M1 (M232)
Dr. John Urschel (MIT)
TBA
Tuesday 10 March 2026, 15:15, U5 (U147)
Show the events of the past year
Sivusta vastaa: webmaster-math [at] list [dot] aalto [dot] fi