Winter Semester 2025/2026

Gábor Péter Nagy is a researcher from the University of Szeged, Hungary. His research interests include finite geometry, computer algebra and coding theory, and the mathematical theory of cryptography, with a particular focus on methods and results that utilize group theory tools to describe the structures under study.

He received his PhD in 2000 from the Institute of Mathematics at the University of Erlangen, where he completed his dissertation on algebraic commutative Moufang loops. In 2007, he was a Marie Curie Fellow at the University of Würzburg, during which time he solved the long-standing problem of the existence of finite simple Bol loops, as well as a question posed by Michael Aschbacher.

Between 2017 and 2023, Prof. Nagy headed the Department of Algebra at the Budapest University of Technology. He is currently the head of the Doctoral School of Mathematics at the Bolyai Institute in Szeged, Hungary.

Prof. Nagy's research in finite geometry has focused on the algebraic and combinatorial description of point sets of projective spaces over finite fields, as well as classifications of Latin squares, designs, and similar combinatorial objects. His work on the parameters of error-correcting codes defined over algebraic curves and the nonlinearity properties of vectorial Boolean functions is also related to modern information technology.

In the winter semester of the 2025/2026 academic year, Prof. Nagy will be teaching the Giovanni Prodi course "Strongly Regular Graphs and Finite Geometries", which will consist of a lecture and an associated exercise session. (See WueStudy)