Abel Prize 2026-11-05
The Abel Prize is an international award for outstanding work in mathematics, named after Niels Henrik Abel. It was first awarded in 2003 to Jean-Pierre Serre. The Norwegian Academy of Science and Letters administers the selection.[ref]
The mathematical work behind an award is more informative than the honour alone. The 2009 award recognized Mikhail Gromov's contributions to geometry and topology, including global geometric questions whose behaviour cannot be read from local coordinates alone.[ref]
https://abelprize.no/abel-prize-laureates/2009. Official laureate page and linked mathematical citation
The 2021 award to László Lovász and Avi Wigderson recognized contributions connecting discrete mathematics and theoretical computer science.[ref]https://abelprize.no/abel-prize-laureates/2021. Official laureate announcement
The prize's scope therefore spans several mathematical traditions. Discrete mathematics Created 2026-10-31 Updated 2026-11-05
Discrete mathematics studies structures built from distinct objects and finite or countable choices. Its main connections include combinatorics, graph theory, number theory, mathematical logic and the analysis of algorithms. The distinction concerns the structures under study, rather than a ban on using real numbers or analysis in proofs.
For example, a graph with vertices has possible unordered edges when loops and repeated edges are excluded. Counting possible edge sets gives labeled simple graphs. A small modeling assumption about allowed edges has turned a structural question into an exact counting formula. Such translations underpin scheduling, networks and computer science.
The nine-page University of Oxford Computer Science Prelims paper dated 20 June 2013. The public released examination archive contains the original scan as
4223-1.pdf. Printed pages 2–4 cover discrete mathematics, pages 5–6 cover calculus and ordinary differential equations, and pages 7–9 cover probability theory. Question 8(c)(i) introduces the two-roll model without asking for a separate calculation; Question 8(c)(v) allows the trivial independence of an impossible event unless the values are restricted to the two marginal supports. Igor Pak Created 2026-10-14 Updated 2026-11-05
Igor Pak works in discrete mathematics, including enumerative combinatorics, algebraic combinatorics, polyhedral geometry, and probability and computation on groups. His research page presents these as interconnected subjects and lists lectures on convex polytopes and combinatorial inequalities.[ref]
https://www.math.ucla.edu/~pak/. Research statement and selected lectures
A common theme is to explain a numerical counting identity through the structure of the objects being counted, such as a bijection, rather than relying only on algebraic manipulation. Polyhedral methods add geometric constraints to those discrete enumeration questions.Homepage: www.math.ucla.edu/~pak/
László Lovász 2026-11-05
László Lovász is a mathematician whose work connects combinatorics, graph theory and efficient algorithms. With Arjen K. Lenstra and Hendrik W. Lenstra, he developed the LLL algorithm, which replaces a basis of a Euclidean lattice by a more geometrically controlled basis of the same lattice. Their 1982 paper uses lattice reduction to factor polynomials over the rational numbers in polynomial time.[ref]
Factoring Polynomials with Rational Coefficients by Arjen K. Lenstra and others. Introduction and section 1
The point of reduction is not to change the lattice: integer basis changes preserve it. Instead, shorter, better organized vectors expose relations hidden by a poor basis. This is a striking bridge from geometric reasoning to exact algebraic computation. Lovász shared the 2021 Abel Prize with Avi Wigderson for contributions linking discrete mathematics and theoretical computer science.[ref]
https://abelprize.no/abel-prize-laureates/2021. Official 2021 laureate announcement
László Lovász; photograph by Peter Badge, Abel Prize laureate page
. 
