Hyperplane Diameter Conjecture for bounded cells of arrangements

About 16 years old · traced to

Let A\mathcal{A} be a simple arrangement of nn hyperplanes in dimension dd, and let HA(n,d)H_\mathcal{A}(n,d) be the maximum average graph diameter of its bounded cells.

Hyperplane Diameter Conjecture.

HA(n,d)≤d.H_\mathcal{A}(n,d) \leq d.

The conjecture concerns the average diameter of bounded cells in simple hyperplane arrangements. The supplied material gives no resolution status.

References

Primary source

Edward D. Kim, “Geometric Combinatorics of Transportation Polytopes and the Behavior of the Simplex Method”, arXiv:1006.2416 (2010).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.