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
- 12.2. 16:00 Anestis Tzogias (U. Neuchatel): The Arakelov class group and hard cryptographic problems on ideal lattices – M237
Euclidean lattices are a trendy topic from the applied side, as they are a very promising candidate for constructing quantum-resistant cryptographic protocols, based on hard problems such as the Shortest Vector Problem (SVP). Ideal lattices are a class of lattices coming from ideals in number fields, and recently they have been getting attention for allowing efficient implementation of cryptographic lattice protocols, with perhaps the most famous being based on the Learning With Errors problem. From the mathematical side, the space of all ideal lattices up to isometry is an object well-known to number theorists, called the Arakelov class group. We will discuss a result of de Boer et al. which uses random walks on the topological structure of the Arakelov class group and the Extended Riemann Hypothesis to relate the average-case and worst-case instances of the SVP problem on ideal lattices.
Algebra and Discrete Mathematics at Aalto is supported by
Page content by: webmaster-math [at] list [dot] aalto [dot] fi
