Sascha Kurz

Sascha Kurz is an Associate Professor at the Mathematical Institute of the Faculty of Mathematics, Physics and Computer Science at the University of Bayreuth, Germany. His research focuses on discrete structures, coding theory, voting systems, and combinatorial optimization.

Professor Kurz's primary research interests span several interconnected fields in discrete mathematics and its applications:

• Coding Theory: With a focus on divisible codes, subspace codes, and constant dimension codes, his work explores the theoretical foundations and practical applications of error-correcting codes.
• Discrete Geometry: His research in finite geometry, particularly on arcs in projective spaces and vector space partitions, contributes to both theoretical understanding and coding applications.
• Game Theory and Voting Systems: He investigates power indices, weighted voting games, and their applications to political science and decision-making processes.
• Combinatorial Optimization: His work includes network coding, subspace packings, and algorithmic approaches to classification problems in coding theory.

Analysis of Professor Kurz's recent publications reveals a strong focus on the intersection of coding theory and discrete geometry. His work consistently addresses fundamental questions about code parameters, classifications, and constructions, with particular attention to divisible codes and their properties. There's a clear progression from theoretical foundations to computational methods, as evidenced by his increasing use of computer-assisted classification techniques. His research demonstrates significant contributions to understanding the structure of linear codes, subspace codes, and their geometric interpretations.

Professor Kurz has made notable contributions to both theoretical and applied aspects of his fields, collaborating with researchers across Europe and beyond. His work bridges pure mathematics with practical applications in information theory and network communication.