Reading's Problem 9.3: Order Dimension Versus Rank for Simplicial Arrangements
Reading computed the order dimension of the poset of regions for most finite Coxeter arrangements, observed that an exceptional type whose dimension exceeds its rank would be the first known simplicial arrangement with that property, and recorded the general guess that every simplicial region poset has dimension equal to its rank (Problem 9.3 of his 2016 chapter); Segovia later asked the analogous question for oriented-poset lattices. False: the order dimension of the poset of regions can exceed the rank - the Coxeter arrangements and satisfy and .
- Result
- Disproved
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Construction
- Field
- Posets / hyperplane arrangements
- Posed by
- Nathan Reading; Segovia
- Year posed
- 2016
- Years open
- 10y
- Solved
- 2026-08-14
- Model
- ChatGPT 5.6 Sol Ultra
- Vendor
- OpenAI
- Collaborators
- Daria Poliakova
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 15 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The declaration, in full: "The small obstruction subgraphs were found by ChatGPT 5.6 Sol Ultra. The human input was the belief that the rank guess is incorrect, and one should look for counterexamples." The obstruction subgraphs are the entire content of the disproof, so the model produced the central objects under human direction.
Verification
Checked by this site on 17 August 2026 against the paper's LaTeX (arXiv:2608.14092): the declaration is verbatim, and the problem attribution is precise - Reading's Problem 9.3 (2016) with the H_4/E_6 background from his 2003 computations, plus Segovia's analogous question. The obstruction subgraphs were not re-verified here. Days-old preprint, no independent review.