Discrete Mathematics

  • Postbus 513, MF

    5600MB Eindhoven



Introductie / missie

The three chairs within DM maintain the three main research areas: the more applied coding theory and cryptology; the combinatorial optimization which goes into problems in operational management; and the more fundamental discrete algebra and geometry.

Highlighted phrase

The section DM is interested in all mathematical problems of a discrete nature.

Over de organisatie

The section DM has three chairs:

The chair for Coding Theory and Cryptology (CC) performs research in theoretical and applied areas of both topics:

Coding Theory is the mathematical theory of encoding information in such a way that it becomes resistant to transmission errors. The main topics are the study of the properties of various codes (cyclic codes, BCH-codes, MDS-codes, algebraic-geometric codes) and the construction of efficient decoding algorithms for these codes.

Cryptology is the mathematical theory of protecting information against unauthorized access (privacy), determining if a message has been altered by a third party (integrity), adding a signature to an electronic document and verifying the identity.

The Combinatorial Optimization (CO) group focuses on the analysis and solution of discrete algorithmic problems that are computationally difficult (NP-hard). A generic formulation of such problems is: given a number of boundary conditions and constraints, find a solution that minimizes the cost or maximizes the profit.

Phenomena throughout mathematics and the natural sciences have discrete algebraic aspects, often along with analytical counterparts. While the latter are typically modelled using real numbers, differential equations, and numerical computations, describing the discrete-algebraic aspects involves objects like nite elds, graphs, polynomials, groups, algebras, and symbolic computations. The Discrete Algebra and Geometry (DAG) group at the TU/e develops the mathematics needed for such a description.

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 1973 2019

An algorithm for komlós conjecture matching Banaszczyk's bound

Bansal, N., Dadush, D. & Garg, S., 30 apr 2019, In : SIAM Journal on Computing. 48, 2, blz. 534-553 20 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Open Access
Set Systems
Efficient Algorithms

Application of complementary dual AG codes to entanglement-assisted quantum codes

Fernandes Pereira, F., Pellikaan, R., Gadioli La Guardia, G. & de Assis, F. M., 2019, (Geaccepteerd/In druk) Proceedings of the IEEE International Symposium on Information Theory. Piscataway: Institute of Electrical and Electronics Engineers

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Asymptotics of symmetry in matroids

Pendavingh, R. & van der Pol, J., 1 mrt 2019, In : Journal of Combinatorial Theory. Series B. 135, blz. 349-365

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Automorphism Group


Algorithms for coping with uncertainty and intractability

Nikhil Bansal (Ontvanger), 2013

Prijs: ERCConsolidatorWetenschappelijk

Combinatorial optimization
Approximation algorithms
Computer science
Optimum design

Best investigative reporting

Jacob Appelbaum (Ontvanger), 2014

Prijs: AndersWerk, activiteit of publicatie gerelateerde prijzen (lifetime, best paper, poster etc.)Wetenschappelijk

Best Paper Award at IH&MMSec 2015

Thijs Laarhoven (Ontvanger), 19 jun 2015

Prijs: AndersWerk, activiteit of publicatie gerelateerde prijzen (lifetime, best paper, poster etc.)Wetenschappelijk


Activiteiten 2016 2017

  • 3 Aangemelde presentatie
  • 1 Workshop, seminar, cursus of expositie

On the Rate of the Binary Puzzle

Putranto Utomo (Spreker)
7 aug 20179 aug 2017

Activiteit: Types gesprekken of presentatiesAangemelde presentatieWetenschappelijk

Fifth Code-based Cryptography Workshop

Putranto Utomo (Deelnemer)
31 mei 20172 jun 2017

Activiteit: Types deelname aan of organisatie van een evenementWorkshop, seminar, cursus of expositieWetenschappelijk

Satisfiability Modulo Theory and Binary Puzzle

Putranto Utomo (Spreker)
6 dec 20167 dec 2016

Activiteit: Types gesprekken of presentatiesAangemelde presentatieWetenschappelijk


Dutch report finds cybersecurity not keeping up with growing number of attacks

Tanja Lange


1 item van media-aandacht

Pers / media: Vakinhoudelijk commentaar

Veiligheid versus privacy: een valse tegenstelling

Tanja Lange


2 mediabijdrages

Pers / media: PR activiteiten


A characterization of the special linear and unitary Lie algebra via its extremal geometry

Auteur: Oostendorp, M., 31 aug 2018

Begeleider: Cuypers, F. (Afstudeerdocent 1)

Scriptie/masterproef: Master


Achieving differential privacy in secure multiparty computation

Auteur: Thissen, K., 15 mei 2019

Begeleider: Schoenmakers, B. (Afstudeerdocent 1), Koster, R. (. (Externe persoon) (Externe coach) & van Liesdonk, P. (Externe coach)

Scriptie/masterproef: Master


An adaption of the crossbred algorithm for solving multivariate quadratic systems over F2 on GPUs

Auteur: Ning, K., 27 nov 2017

Begeleider: Lange, T. (Afstudeerdocent 1), Bernstein, D. (Externe coach) & Niederhagen, R. (Externe coach)

Scriptie/masterproef: Master