The constraining conjecture for irredundant minimal twisted graphs
Statement
Let be a twisted graph. A vector respects when for all and implies . The graph is constraining if, for some such , the system is not soluble and has a nontrivial solution. An irredundant -minimal twisted graph is one satisfying the stated irredundancy and minimality conditions.
Constraining conjecture. Every irredundant -minimal twisted graph is constraining.
This is presented as a strengthening of the general unsolvability conjecture. It seeks a precise minimal-obstruction structure for line-arrangement realizability, but no resolution is supplied in the paper.
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.