Zoltán Füredi

from Wikipedia, the free encyclopedia

Zoltán Füredi (born May 21, 1954 in Budapest ) is a Hungarian mathematician who deals with combinatorics and discrete geometry.

Life

Füredi studied at the Loránd Eötvös University in Budapest , where he graduated in 1978 ( linear programming and hypergraphs ). In 1981 he received his doctorate in Budapest under Gyula Katona ( extremal hypergraphs and finite geometries ). From 1978 he was at the Alfred Renyi Institute of the Hungarian Academy of Sciences . In 1985 he went to Rutgers University , became an assistant professor at the Massachusetts Institute of Technology in 1986 , was an associate professor at MIT in 1990 and, from 1991, professor of mathematics at the University of Illinois at Urbana-Champaign . In addition, he has been a scientific advisor at the Alfred Renyi Institute since 1990.

Since 2004 he has been a corresponding member of the Hungarian Academy of Sciences. In 1994 he was invited speaker at the International Congress of Mathematicians in Zurich (Extremal hypergraphs and combinatorial geometry).

plant

Füredi was particularly concerned with problems of the Turan type, which ask about the maximum number of edges of an n-point graph that does not contain certain graphs as subgraphs (for example circular graphs).

In 1984, together with I. Palasti, he investigated the arrangement of lines in the plane with as many triangles as possible with application to the Orchard Planting problem of arrangements of points in the plane with as many lines as possible through three points each. In 1990 he proved that the maximum number of unit spaces in a convex n-gon is at most .

Füredi published ten works with Paul Erdős . For example, they proved that in d-dimensional Euclidean space there are a set of points with at least elements in which all angles defined by three points are smaller than right angles.

In 1989 Füredi, Imre Bárány and László Lovász proved an asymptotic estimate for the number of planes that divide a set S of n points in three-dimensional Euclidean space in general in two halves (the planes each passing through three points of S). With Barany and J. Pach he proved László Fejes Tóth's six-circle conjecture . It says that with a circle packing in the plane in which each circle has six neighboring circles, either the hexagonal circle packing with circles of the same radius is present or circles with arbitrarily small radius occur.

With Barany he gave an algorithm for the Mental Poker Problem and proved that the computation of the volume in d-dimensional space is a non-polynomial-time problem.

In 1996, with Gabor Szekely and Zoltan Zubor, he solved a combinatorial problem with applications to the Hungarian lottery.

Web links

Homepage

Individual evidence

  1. ↑ Füredi Turan type problems in Keedwell (editor) Surveys in combinatorics , London Mathematical Society Lecture Notes, Volume 166, 1991, pp. 253-300
  2. ↑ Füredi, Palasti Arrangement of lines with a large number of triangles , Proc. American Mathematical Society, Vol. 92, 1984, p. 561
  3. ↑ Füredi The maximum number of unit distances in a convex n-gon , J. Comb. Theory, Series A, Vol. 55, 1990, pp. 316-320
  4. ^ The greatest angle among n points in d dimensional euclidean space , Annals of Discrete Mathematics, Volume 17, 1983, pp. 275-283
  5. ↑ Barany, Füredi, Lovasz On the number of halving planes , Combinatorica, Volume 10, 1990, pp. 175-185
  6. ↑ Barany, Füredi, Pach: Discrete convex functions and proof of the six circle conjecture of L. Fejes Toth , Canadian J. Mathematics, Volume 36, 1983, pp. 569-576
  7. ↑ Barany, Füredi Mental poker with three or more players , Information and Control, Volume 59, 1983, pp. 84-93
  8. ↑ Barany, Füredi Computing the volume is difficult , Discrete and Computational Geometry, Volume 2, 1987, pp. 319-326
  9. ↑ Füredi, Szekely, Zubor On the lottery problem , J. of Combinatorial Designs, Volume 4, 1996, pp. 5-10
personal data
SURNAME Füredi, Zoltan
BRIEF DESCRIPTION Hungarian mathematician
DATE OF BIRTH May 21, 1954
PLACE OF BIRTH Budapest