Grünbaum's conjecture on unstretchable simplicial arrangements
Grünbaum's conjecture on unstretchable simplicial arrangements
A simplicial arrangement is a finite set of hyperplanes whose complement has only simplicial cones as connected components; in the projective-plane setting, these are arrangements of pseudolines. Two arrangements are isomorphic when they are equivalent under the relevant combinatorial notion, and an arrangement is unstretchable if it is not realizable by straight lines.
Grünbaum's conjecture. Up to isomorphism, there are only simplicial unstretchable arrangements of or pseudolines.
The paper reports further examples disproving this conjecture, so the claim is refuted. The broader classification of simplicial arrangements remains an open problem.
Sources & referencesView supporting material
Primary source
Michael Cuntz, “Simplicial arrangements with up to 27 lines”, arXiv:1108.3000 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.