ITLApplied  Computational Mathematics Division
ACMD Seminar Series
Attractive Image NIST

Some Problems of Combinatorial Geometry

James Lawrence
Dept. of Mathematics, GMU

Tuesday, December 4, 2001 15:00-16:00,
Room 145, NIST North (820)
Tuesday, December 4, 2001 13:00-14:00,
Room 4511

Abstract: There are multitudes of interesting and apparently difficult problems relating to the combinatorics of convex sets. We discuss open questions associated with the convexity theorems of Radon and Tverberg, and questions concerning the crossing numbers of complete graphs and their generalizations to higher dimensions. Some of these questions are considered in the setting provided by oriented matroids.
Contact: A. J. Kearsley

Note: Visitors from outside NIST must contact Robin Bickel; (301) 975-3668; at least 24 hours in advance.

Privacy Policy | Disclaimer | FOIA
NIST is an agency of the U.S. Commerce Department.
Last updated: 2011-01-12.