Zoltán Füredi

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]

Some results
  • In infinitely many cases he determined the maximum number of edges in a graph with no C4.
  • With Paul Erdős he proved that for some c>1, there are cd 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 dd.
  • He proved that there are at most unit distances in a convex n-gon.[2]
  • In a paper written with coauthors he solved the Hungarian lottery problem.[3]
  • With Ilona Palásti he found the best known lower bounds on the orchard-planting problem of finding sets of points with many 3-point lines.[4]
  • He proved an upper bound on the ratio between the fractional matching number and the matching number in a hypergraph.[5]
gollark: You can just do *some* privacy-benefiting stuff but not go full something or other.
gollark: You could say it about lots of things. Dealing with dangerous dangers is sensible as long as the cost isn't more than, er, chance of bad thing times badness of bad thing.
gollark: Probably.
gollark: Oh, and, additionally (I thought of and/or remembered this now), knowing your actions are monitored is likely to change your behavior too, and make you less likely to do controversial things, which is not very good.
gollark: i.e. demonstrate that they can actually function well, enforce the law reasonably, have reasonable laws *to* enforce in the first place, with available resources/data, **before** invading everyone's privacy with the insistence that they will totally make everyone safer.

References
  1. Zoltán Füredi at the Mathematics Genealogy Project
  2. Z. Füredi (1990). "The maximum number of unit distances in a convex n-gon". Journal of Combinatorial Theory. 55 (2): 316–320. doi:10.1016/0097-3165(90)90074-7.
  3. Z. Füredi, G. J. Székely, and Z. Zubor (1996). "On the lottery problem". Journal of Combinatorial Designs. 4 (1): 5–10. doi:10.1002/(sici)1520-6610(1996)4:1<5::aid-jcd2>3.3.co;2-w.CS1 maint: multiple names: authors list (link) Reprint
  4. 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, doi:10.2307/2045427, JSTOR 2045427.
  5. Füredi, Zoltán (1 June 1981). "Maximum degree and fractional matchings in uniform hypergraphs". Combinatorica. 1 (2): 155–162. doi:10.1007/BF02579271. ISSN 1439-6912.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.