Discrete Mathematics, Computer Science and Logic
Discrete Mathematics within BGSMath comprises several related fields: Combinatorics, graph theory, coding theory, cryptography, discrete and computational geometry, among others. It is characterized by the analysis of discrete structures, such as graphs, partial orders, finite fields, combinatorial geometries, using algebraic, analytic, and probabilistic methods.
Research in computer science includes algorithms, complexity theory, computer vision, machine learning, and discrete and computational geometry. There are strong interactions between discrete mathematics and computer science, as exemplified by the LIMDA joint seminar.
Research on logic and set theory focuses on model theory, non classical logics, forcing and large cardinals.
Combinatorics and Graph theory
Logic and Set theory
Algorithms, Complexity, and Computational Geometry
Keywords: Analysis of algorithms. Computational complexity theory. Data mining and machine learning. Discrete and computational geometry. Random graphs.
Carme Àlvarez (UPC)
Argimiro Arratia (UPC)
Albert Atserias (UPC)
Víctor Dalmau (UPF)
Josep Díaz (UPC)
Ricard Gavaldà (UPC)
Julian Pfeifle (UPF)
Vera Sacristán (UPC)
Maria José Serna (UPC)
Rodrigo Silveira (UPC)
Coding theory, Information theory and Cryptography
Keywords: Information theory. Minimum distance codes. Optimal coding. Secret sharing.
Simeon Ball (UPC)
Cristina Fernández-Córdoba (UAB)
Albert Guillén i Fábregas (UPF)
Javier Herranz (UPC)
Alfonso Martínez (UPF)
Paz Morillo (UPC)
Carles Padró (UPC)
Josep Rifà (UAB)
Maria German Sáez (UPC)
Mercè Villanueva (UAB)
Andreas Winter (UAB)
Links to research groups
Researchers in the Barcelona area, and more generally in Catalonia, group themselves into smaller research groups, following not only academic but also administrative criteria, like location or research grants.