McMullen problem

From testwiki
Revision as of 18:45, 6 July 2021 by imported>OAbot (Open access bot: doi added to citation with #oabot.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Unsolved The McMullen problem is an open problem in discrete geometry named after Peter McMullen.

Statement

In 1972, David G. Larman wrote about the following problem:Template:R Template:Block indent Larman credited the problem to a private communication by Peter McMullen.

Equivalent formulations

Gale transform

Using the Gale transform, this problem can be reformulated as: Template:Block indent

The numbers ν of the original formulation of the McMullen problem and μ of the Gale transform formulation are connected by the relationships μ(k)=min{wwν(wk1)}ν(d)=max{wwμ(wd1)}

Partition into nearly-disjoint hulls

Also, by simple geometric observation, it can be reformulated as: Template:Block indent

The relation between μ and λ is μ(d+1)=λ(d),d1

Projective duality

An arrangement of lines dual to the regular pentagon. Every five-line projective arrangement, like this one, has a cell touched by all five lines. However, adding the line at infinity produces a six-line arrangement with six pentagon faces and ten triangle faces; no face is touched by all of the lines. Therefore, the solution to the McMullen problem for d = 2 is ν = 5.

The equivalent projective dual statement to the McMullen problem is to determine the largest number ν(d) such that every set of ν(d) hyperplanes in general position in d-dimensional real projective space form an arrangement of hyperplanes in which one of the cells is bounded by all of the hyperplanes.

Results

This problem is still open. However, the bounds of ν(d) are in the following results:

The conjecture of this problem is that ν(d)=2d+1. This has been proven for d=2,3,4.Template:R

References

Template:Reflist