Mathematical Sciences: Combinatorial Structure of Polytopes
{'Code': '03040300', 'Directorate': {'Abbreviation': 'MPS', 'LongName': 'Direct For Mathematical & Physical Scien'}, 'Division': {'Abbreviation': 'DMS', 'LongName': 'Division Of Mathematical Sciences'}}
{'SignBlockName': 'Ann K. Boyle'}
This research is concerned primarily with the combinatorics                of convex polytopes, including questions about barycentric                      subsivisions, facial enumerations, and other combinatorial                      questions about the special classes of k-simplicial and h-                      simplicial polytopes.                                                                Knowing how many faces there can be in a polytope has turned               out to be of interest to some computer scientists and geometers.                Such knowledge is important in finding convenient data structures               for storing geometric data and in analyzing the complexity of                   algorithms.
{'FirstName': 'Margaret', 'LastName': 'Bayer', 'EmailAddress': 'bayer@ku.edu', 'StartDate': '06/15/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Kansas Main Campus', 'CityName': 'Lawrence', 'ZipCode': '660457563', 'PhoneNumber': '7858643441', 'StreetAddress': '2385 Irving Hill Road', 'CountryName': 'United States', 'StateName': 'Kansas', 'StateCode': 'KS'}
{'Code': '1264', 'Text': 'ALGEBRA,NUMBER THEORY,AND COM'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8801078.xml'}