= László Lovász
{c}
<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.<Factoring Polynomials with Rational Coefficients by Arjen K. Lenstra and others>[Introduction and section 1]{ref}
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>.https://abelprize.no/abel-prize-laureates/2021[Official 2021 laureate announcement]{ref}
\Image[https://abelprize.no/sites/default/files/styles/gutenberg_style_rect_front/public/2021-08/2021_Lovasz_P.Bagde_.jpg?itok=_8_ukZad]
{title=László Lovász; photograph by Peter Badge, Abel Prize laureate page}
{height=240}
Back to article page
