Grünbaum's conjecture on unstretchable simplicial arrangements
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.