György Elekes (19 May 1949 – 29 September 2008) was a Hungarian

mathematician A mathematician is someone who uses an extensive knowledge of mathematics in their work, typically to solve mathematical problems. Mathematicians are concerned with numbers, data, quantity, structure, space, models, and change. History On ...

and

computer scientist A computer scientist is a person who is trained in the academic study of computer science. Computer scientists typically work on the theoretical side of computation, as opposed to the hardware side on which computer engineers mainly focus (al ...

who specialized in

Combinatorial geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geo ...

and

Combinatorial set theory In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Re ...

. He may be best known for his work in the field that would eventually be called

Additive Combinatorics Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are ''inverse problems'': given the size of the sumset ''A'' + ''B'' is small, what can we say about the structures of A ...

. Particularly notable was his "ingenious" application of the

Szemerédi–Trotter theorem The Szemerédi–Trotter theorem is a mathematical result in the field of Discrete geometry. It asserts that given points and lines in the Euclidean plane, the number of incidences (''i.e.'', the number of point-line pairs, such that the point ...

to improve the best known lower bound for the sum-product problem. He also proved that any

polynomial-time algorithm In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by t ...

approximating the

volume Volume is a measure of occupied three-dimensional space. It is often quantified numerically using SI derived units (such as the cubic metre and litre) or by various imperial or US customary units (such as the gallon, quart, cubic inch). The de ...

convex bodies In mathematics, a convex body in n-dimensional Euclidean space \R^n is a compact convex set with non-empty interior. A convex body K is called symmetric if it is centrally symmetric with respect to the origin; that is to say, a point x lies in ...

must have a multiplicative error, and the error grows

exponentially Exponential may refer to any of several mathematical topics related to exponentiation, including: *Exponential function, also: **Matrix exponential, the matrix analogue to the above *Exponential decay, decrease at a rate proportional to value *Expo ...

on the dimension. With

Micha Sharir Micha Sharir ( he, מיכה שריר; born 8 June 1950 in Tel Aviv, Israel) is an Israeli mathematician and computer scientist. He is a professor at Tel Aviv University, notable for his contributions to computational geometry and combinatorial geo ...

he set up a framework which eventually led Guth and

Katz Katz or KATZ may refer to: Fiction * Katz Kobayashi, a character in Japanese anime * "Katz", a 1947 Nelson Algren story in '' The Neon Wilderness'' * Katz, a character in ''Courage the Cowardly Dog'' Other uses * Katz (surname) * Katz, British C ...

to the solution of the

Erdős distinct distances problem In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances. It was posed by Paul Erdős in 1946 and almost proven by Larry Guth and Nets Katz in 2015. ...

.The Erdős distance problem
(See below.)

Life

After graduating from the mathematics program at Fazekas Mihály Gimnázium (i.e., " Fazekas Mihály high school" in

Budapest Budapest (, ; ) is the capital and most populous city of Hungary. It is the ninth-largest city in the European Union by population within city limits and the second-largest city on the Danube river; the city has an estimated population ...

, which is known for its excellence, especially in mathematics), Elekes studied mathematics at the

Eötvös Loránd University Eötvös Loránd University ( hu, Eötvös Loránd Tudományegyetem, ELTE) is a Hungarian public research university based in Budapest. Founded in 1635, ELTE is one of the largest and most prestigious public higher education institutions in Hung ...

. Upon completing his degree, he joined the faculty in the Department of

Analysis Analysis ( : analyses) is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it. The technique has been applied in the study of mathematics and logic since before Aristotle (38 ...

at the university. In 1984, he joined the newly forming Department of

Computer Science Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...

, which was being headed by

László Lovász László Lovász (; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He wa ...

. Elekes was promoted to

full professor Professor (commonly abbreviated as Prof.) is an academic rank at universities and other post-secondary education and research institutions in most countries. Literally, ''professor'' derives from Latin as a "person who professes". Professors ...

in 2005. He received the '' Doctor of Mathematical Sciences'' title from the

Hungarian Academy of Sciences The Hungarian Academy of Sciences ( hu, Magyar Tudományos Akadémia, MTA) is the most important and prestigious learned society of Hungary. Its seat is at the bank of the Danube in Budapest, between Széchenyi rakpart and Akadémia utca. Its ma ...

in 2001.

Work

Elekes started his mathematical work in

combinatorial set theory In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Re ...

, answering some questions posed by

Erdős Erdős, Erdos, or Erdoes is a Hungarian surname. People with the surname include: * Ágnes Erdős (born 1950), Hungarian politician * Brad Erdos (born 1990), Canadian football player * Éva Erdős (born 1964), Hungarian handball player * Józse ...

and Hajnal. One of his results states that if the set of infinite subsets of the set of natural numbers is split into countably many parts, then in one of them, there is a solution of the equation ''A''∪''B''=''C''. His interest later switched to another favorite topic of Erdős,

discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geome ...

and geometric algorithm theory. In 1986 he proved that if a deterministic polynomial algorithm computes a number ''V''(''K'') for every convex body ''K'' in any Euclidean space given by a separation oracle such that ''V''(''K'') always at least vol(''K''), the volume of ''K'', then for every large enough dimension ''n'', there is a convex body in the ''n''-dimensional Euclidean space such that ''V''(''K'')>2^0.99''n''vol(''K''). That is, any polynomial-time estimator of volume over ''K'' must be inaccurate by at least an exponential factor. Not long before his death he developed new tools in

Algebraic geometry Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical ...

and used them to obtain results in

Discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geome ...

, proving Purdy's Conjecture.

organized, extended and published Elekes's posthumous notes on these methods.''On lattices, distinct distances, and the Elekes-Sharir framework'', Javier Cilleruelo, Micha Sharir, Adam Sheffer, https://arxiv.org/abs/1306.0242 Then

Nets Katz Nets Hawk Katz is the IBM Professor of Mathematics at the California Institute of Technology. He was a professor of Mathematics at Indiana University Bloomington until March 2013. Katz earned a B.A. in mathematics from Rice University in 1990 at t ...

and

Larry Guth Lawrence David Guth (born 1977) is a professor of mathematics at the Massachusetts Institute of Technology. Education and career Guth graduated from Yale in 2000, with BS in mathematics. In 2005, he got his PhD in mathematics from the Massach ...

used them to solve (apart from a factor of (log n) ^1/2) the

, posed in 1946.

References

External links

Elekes' home page
{{DEFAULTSORT:Elekes, Gyorgy Number theorists Combinatorialists Researchers in geometric algorithms 20th-century Hungarian mathematicians 21st-century Hungarian mathematicians Hungarian computer scientists 1949 births 2008 deaths