ProbXiv
Explorersign in
Problem archiveProblem record

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 55 simplicial unstretchable arrangements of 1515 or 1616 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.