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
. Articles by others on the same topic
László Lovász is a prominent Hungarian mathematician known for his significant contributions to various areas of mathematics, particularly in combinatorics, graph theory, and theoretical computer science. Born on March 9, 1937, he has made foundational contributions to fields such as discrete mathematics and algorithms. One of his notable achievements is the development of the Lovász Local Lemma, a powerful tool in probabilistic combinatorics.