Zoltán Füredi (

Budapest Budapest is the Capital city, capital and List of cities and towns of Hungary, most populous city of Hungary. It is the List of cities in the European Union by population within city limits, tenth-largest city in the European Union by popul ...

Hungary Hungary is a landlocked country in Central Europe. Spanning much of the Pannonian Basin, Carpathian Basin, it is bordered by Slovakia to the north, Ukraine to the northeast, Romania to the east and southeast, Serbia to the south, Croatia and ...

, 21 May 1954) is a Hungarian mathematician, working in

combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...

, mainly 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 geom ...

and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the

Hungarian Academy of Sciences The Hungarian Academy of Sciences ( , MTA) is Hungary’s foremost and most prestigious learned society. Its headquarters are located along the banks of the Danube in Budapest, between Széchenyi rakpart and Akadémia utca. The Academy's primar ...

(2004). He is a research professor of the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and a professor at the

University of Illinois Urbana-Champaign The University of Illinois Urbana-Champaign (UIUC, U of I, Illinois, or University of Illinois) is a public university, public land-grant university, land-grant research university in the Champaign–Urbana metropolitan area, Illinois, United ...

(UIUC). Füredi received his

Candidate of Sciences A Candidate of Sciences is a Doctor of Philosophy, PhD-equivalent academic research degree in all the post-Soviet countries with the exception of Ukraine, and until the 1990s it was also awarded in Central and Eastern European countries. It is ...

degree in mathematics in 1981 from the Hungarian Academy of Sciences.

Some results

* In infinitely many cases he determined the maximum number of edges in a

graph Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discret ...

with no ''C''₄. * With

Paul Erdős Paul Erdős ( ; 26March 191320September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, g ...

he proved that for some ''c''>1, there are ''c''^''d'' points in ''d''-dimensional space such that all triangles formed from those points are acute. * With Imre Bárány he proved that no

polynomial time In theoretical 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 p ...

algorithm determines the volume of convex bodies in dimension ''d'' within a multiplicative error ''d''^''d''. * He proved that there are at most

O(n\log n)

unit distances in a convex ''n''-gon. * In a paper written with coauthors he solved the Hungarian

lottery A lottery (or lotto) is a form of gambling that involves the drawing of numbers at random for a prize. Some governments outlaw lotteries, while others endorse it to the extent of organizing a national or state lottery. It is common to find som ...

problem. * With

Ilona Palásti Ilona Palásti (1924–1991) was a Hungarian mathematician who worked at the Alfréd Rényi Institute of Mathematics. She is known for her research in discrete geometry, geometric probability, and the theory of random graphs. With Alfréd Rén ...

he found the best known lower bounds on the

orchard-planting problem In discrete geometry, the original orchard-planting problem (or the tree-planting problem) asks for the maximum number of 3-point lines attainable by a configuration of a specific number of points in the plane. There are also investigations in ...

of finding sets of points with many 3-point lines. * He proved an upper bound on the ratio between the fractional matching number and the matching number in a hypergraph.

References

External links

Füredi's UIUC home page
20th-century Hungarian mathematicians 21st-century Hungarian mathematicians Members of the Hungarian Academy of Sciences Combinatorialists University of Illinois Urbana-Champaign faculty 1954 births Living people {{Europe-mathematician-stub