Discrete and algorithmic mathematics is an area that studies combinatorial and discrete structures, in particular graphs and networks, finite geometries, discrete geometric structures and combinatorial aspects in algebra and number theory.
It includes their computational and algorithmic aspects arising from the particularly natural connection of discrete mathematics with computer science.
With tools coming from analysis, topology, algebra, geometry and probability and a wide range of applications in computer science, information theory, coding theory, statistics, physics, biology and social sciences, discrete mathematics is a genuine interdisciplinary area both within mathematics and in connection with science and technology as a whole.
The main goal of this Network is to foster cooperation among the existing groups in the area in Spain, reinforcing their scientific collaboration, coordinating scientific activities and training of young researchers and increase the international visibility of the Spanish research in Discrete Mathematics.
It will reinforce the participation of female researchers and promote outreach activities for the social awareness of science and technology with particular focus on Discrete Mathematics.
10 Jul 2025
Amongst every signed sum of a subset of k elements of a given set of n unit vectors in the d-dimensional space, select the one of maximum Euclidean norm, and find how small can this value be. This problem belongs to a very important family of problems in discrete and convex geometry, in particular, to that of 'unit vector balancing problems'. This problem is connected to geometric optimization, geometric discrepancy theory, lp-polarization problem, or p-frame energies, amongst others.
...continue reading.
11 Jun 2025
As it is stated in Hutchcroft’s laudatio, this EMS Prize has been awarded *"for his revolutionary contributions to probability theory and geometric group theory, in particular to percolation theory on general graphs, using tools from geometry, operator theory, group theory and functional analysis."*.
...continue reading.
01 Apr 2025
Richard Montgomery was one of the ten recipients of the prestigious European Mathematical Society (EMS) prize, given in during the ninth European Congress of Mathematics, in Sevilla.
...continue reading.
25 Mar 2025
The Kunz polyhedron is a family of polyhedra whose integer points correspond to numerical semigroups. This blog post explores the connection between the geometry of the Kunz polyhedron and the combinatorial properties of the numerical semigroups it classifies.
...continue reading.
24 Jun 2024
Shortest path problems, where the goal is to find an optimal path between two points in the plane, are among the fundamental problems in computational geometry. These problems are crucial for a variety of applications, GPS navigation is perhaps the best-known application. However, there are numerous daily-life problems that can be solved using shortest path algorithms.
...continue reading.