Wyniki wyszukiwania:

The subject of Finite Geometries is a central part of discrete mathematics. Structures from Finite Geometries have led to solutions of open problems in extremal combinatorics, design theory, and coding theory and cryptography. However, there are no recent textbooks in finite geometry that have a broad scope. This book discusses non-Desarguesian planes and explains the recent proof techniques using polynomials in case of Desarguesian planes. Some applications in extremal combinatorics are also mentioned.

Finite Geometries stands out from recent textbooks on the subject of finite geometries by having a broader scope. This textbook explains the recent proof techniques using polynomials in case of Desarguesian planes.

Discrete Mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, whose outstanding scientific work has defined and shaped many research directions in the past 40 years. A number of friends and colleagues, all top authorities in their fields of expertise gathered at the two conferences in August 2008 in Hungary, celebrating...