Algebra and Discrete Mathematics
Welcome to the home page of the research area of
Algebra and Discrete Mathematics at Aalto University. Our members conduct research in areas that include algebraic geometry, algebraic statistics, combinatorics, coding theory, cryptography, Lie theory, matrix theory, number theory, and representation theory.
Members
Faculty
Algebra and algebraic geometry
Coding theory and cryptography
Combinatorics
Lie theory and representation theory
Number theory
News
- Camilla Hollanti and Ragnar Freij-Hollanti, together with their international team, have won an international mathematical challenge launched by GMV in collaboration with Trampoline Network.
- Rahinatou Yuh Njah Nchiwo won the 3 Minute Thesis competition at the Finnish Quantum Days in September 2024.
- Oscar Kivinen started as an Assistant Professor in September 2023.
Prospective students
Research
We provide
bachelor's,
master's and
doctoral theses topics related to the above areas. The links contain lists of current topics and past theses. Contact the faculty and check their personal webpages for more info.
You are also welcome to take part in any of our
lecture courses related to algebra and discrete mathematics.
Recent publications
Here is the
research output for the Algebra and Discrete Mathematics area. On this site you can also find the research output of individuals and links to full texts of articles when available. For preprints check the
math arxiv and individual homepages.
Scientific events
Seminars
Upcoming seminars
- 19.1. 15:15 Prof. Lalitha Vadlamani (IIIT Hyderabad): Higher Order MDS codes – 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.
Algebra and Discrete Mathematics at Aalto is supported by
Page content by: webmaster-math [at] list [dot] aalto [dot] fi
