Zoltán Füredi

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 Eotvos Lorand University in Budapest, where he was awarded a degree in 1978 ( Linear Programming and hypergraphs ). In 1981 he was in Budapest doctorate in Gyula Katona ( Extremal hypergraphs and finite geometries ). He was from 1978 at the Alfred Renyi Institute of the Hungarian Academy of Sciences. In 1985, he went to Rutgers University, 1986 Assistant Professor at the Massachusetts Institute of Technology, in 1990 associate professor at MIT and as of 1991 professor of mathematics at the University of Illinois at Urbana- Champaign. In addition, he is since 1990 a scientific advisor at the Alfred Renyi Institute.

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

Work

Füredi has been dealing with problems from Turan - type, ask for the maximum number of edges of an n- point graph, the graph is not given as a subgraph contains (eg, circle graphs).

With I. Palásti he examined 1984 Just arrangements in the plane with as many triangles with application to the Orchard Planting problem of arrays of points in the plane with as many lines through three points each. In 1990 he proved that the maximum number of unit distances in a convex n- gon is a maximum.

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

1989 proved Füredi, Imre Bárány and Laszlo Lovasz an asymptotic estimate for the number of levels that share a set S of n points in three-dimensional Euclidean space in general position in two halves ( the planes go each by three points of S). With Barany and J. Pach he proved the six -circle Laszlo Fejes Toth conjecture. It states that occur in a circle packing in the plane in which each circle has six neighboring counties, either the hexagonal circle packing with circles of equal radius is present or circles with arbitrary small radius.

With Barany, he gave an algorithm for the mental poker problem and proved that the calculation of the volume in d- dimensional space is a non- polynomially -temporal problem.

With Gabor Szekely and Zoltan Zubor he dissolved in 1996 a combinatorial problem with applications to the Hungarian lottery.