Mathematics – Metric Geometry
Scientific paper
2009-08-12
Mathematics
Metric Geometry
7 pages, 2 figures
Scientific paper
In a Note added in proof to a 1984 paper, Daniel A. Marcus claimed to have a counterexample to his conjecture that a minimal positively k-spanning vector configuration in R^m has size at most 2km. However, the counterexample was never published, and seems to be lost. Independently, ten years earlier, Peter Mani in 1974 solved a problem by Hadwiger, disproving that every ``illuminated'' d-dimensional polytope must have at least 2d vertices. These two studies are related by Gale duality, an elementary linear algebra technique devised by Micha A. Perles in the sixties. Thus, we note that Mani's study provides a counterexample for Marcus' conjecture with exactly the parameters that Marcus had claimed. In the other direction, with Marcus' tools we provide an answer to a problem left open by Mani: Could ``illuminated'' d-dimensional polytopes on a minimal number of vertices be nonsimplicial?
Wotzlaw Ronald F.
Ziegler Günter M.
No associations
LandOfFree
A Lost Counterexample and a Problem on Illuminated Polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Lost Counterexample and a Problem on Illuminated Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Lost Counterexample and a Problem on Illuminated Polytopes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370649