Zoltán Füredi

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Zoltán Füredi (Budapest, Hungary, 21 May 1954) is a Hungarian mathematician, working in combinatorics, mainly in discrete geometry and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the Hungarian Academy of Sciences (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 (UIUC).

Füredi received his Candidate of Sciences degree in mathematics in 1981 from the Hungarian Academy of Sciences.^[1]

[edit] Some results

In infinitely many cases he determined the maximum number of edges in a graph with no C₄.
With Paul Erdős 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 algorithm determines the volume of convex bodies in dimension d within a multiplicative error d^d.
He proved that there are at least $O(n\log n)$ unit distances among n points in the plane.
In a paper written with coauthors he solved the Hungarian lottery problem.^[2]
With I. Palásti he found the best known lower bounds on the orchard-planting problem of finding sets of points with many 3-point lines.^[3]

^ Zoltán Füredi at the Mathematics Genealogy Project.
^ Z. Füredi, G. J. Székely, and Z. Zubor (1996). "On the lottery problem". Journal of Combinatorial Designs (Wiley) 4 (1): 5–10. [1] Reprint
^ Füredi, Z.; Palásti, I. (1984), "Arrangements of lines with a large number of triangles", Proceedings of the American Mathematical Society 92 (4): 561–566, http://www.jstor.org/stable/2045427 .

This article about a Hungarian scientist is a stub. You can help Wikipedia by expanding it.

This article about a European mathematician is a stub. You can help Wikipedia by expanding it.