Reading's Problem 9.3: Order Dimension Versus Rank for Simplicial Arrangements
Statement
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 .
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
construction · #1
ChatGPT 5.6 Sol Ultra, with Daria PoliakovaThe record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.
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.
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.