* Seuraavan viikon tapahtumat merkitty tähdellä
Dr. Benjamin Jany (TU Eindhoven)
Bounds and field size for locally recoverable codes
* Monday 13 May 2024, 14:15, M2 (M233)
In the last decade, Locally Recoverable Codes (LRC) have been a critical topic in communication and distributed storage. In addition to the minimum distance, dimension and length of a code, LRCs also consider the locality parameter, i.e. the minimum number of entries needed to recover a given entry for any codeword. The parameters of LRCs are subject to a general Singleton bound and codes achieving the bound are called optimal LRCs. Constructions are known when the underlying field size of the code is larger than the length of the code. However, still little is known about the existence of optimal LRCs over small underlying field sizes. In this talk, I will show how we established new bounds that depend on locality and the field size of code using a duality theory of LRCs and
the combinatorial structure of the code. This talk is based on joint work with A. Gruica and A. Ravagnani.
ANTA Seminar / Hollanti et al.
Lilja Metsälampi
Midterm review
* Monday 13 May 2024, 16:15, M3 (M234)
Algebra and discrete mathematics seminar
Prof. Alberto Ravagnani (Eindhoven University of Technology)
The Service Rate Region Polytope
* Tuesday 14 May 2024, 15:15, M1 (M232)
In distributed data storage, information is distributed across multiple servers with redundancy, in such a way that multiple users can access it at the same time. The access requests that a distributed data storage system can support are described by a convex polytope, called the service rate region of the system. This talk is about the properties of the service rate region, and about how the algebra of the system determines the geometry of the corresponding polytope.
Lauri Särkiö
Regularity of parabolic double-phase equations (Midterm review)
* Wednesday 15 May 2024, 11:15, M3 (M234)
Kai Hippi
Quantum ergodicity of a surface with a weak point scatterer
* Wednesday 15 May 2024, 14:15, M3 (M234)
Seminar on analysis and geometry
Meri Aho
On the quality of mathematical writing produced by ChatGPT and Gemini (MSc thesis presentation)
Wednesday 22 May 2024, 11:15, M240
Markus Hirvensalo
Midterm review: TBA
Thursday 23 May 2024, 09:15, M2 (M233)
Patricija Sapokaitė
Midterm review
Monday 27 May 2024, 11:15, M3 (M234)
Algebra and discrete mathematics seminar
Stephen Moore (IMPAN)
Representations of the Reflection Equation Algebra
Tuesday 28 May 2024, 10:15, M3 (M234)
The reflection equation was introduced in relation to quantum integrable systems with boundary condition and is closely related to the Yang-Baxter equation. The reflection equation algebra was in turn introduced to allow the algebraic study of solutions of the reflection equation, similar to the connection between quantum groups and the Yang-Baxter equation. We will describe the basic properties of the reflection equation algebra and explain the classification of its bounded *-representations. This is based on joint work with Kenny De Commer.
Joonas Vättö
Midterm review presentation
Friday 31 May 2024, 10:15, elsewhere
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.
Okko Makkonen
Midterm review: TBA
Thursday 13 June 2024, 11:15, M3 (M234)
ANTA Seminar / Hollanti et al.
Show the events of the past year
Sivusta vastaa: webmaster-math [at] list [dot] aalto [dot] fi