This is a grant made under the USA/USSR program for Cooperation in Basic Scientific Research to further cooperation between Drs. Hemmeter, Lazebnik and Woldar of the University of Delaware and Dr. V. Ustimenko of the University of Kiev. The principal investigators will study association schemes and Tits geometries. In particular, they hope to apply these ideas to extremal graph theory. The research is in the general area of combinatorics. Combinatorics attempts to find efficient methods to study how discrete collections of objects can be organized. It is extremely important to modern communications, for example the design of large networks as in telephone systems and the design of algorithms in computer science.

Agency
National Science Foundation (NSF)
Institute
Division of Mathematical Sciences (DMS)
Type
Standard Grant (Standard)
Application #
9115473
Program Officer
William Y. Velez
Project Start
Project End
Budget Start
1991-07-01
Budget End
1995-06-30
Support Year
Fiscal Year
1991
Total Cost
$32,710
Indirect Cost
Name
University of Delaware
Department
Type
DUNS #
City
Newark
State
DE
Country
United States
Zip Code
19716