ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G⃗\vec{G} be a minimal simply three edge connected, totally cyclic directed graph, and let GG be its underlying graph. A twisted graph has the form T=(G⃗,G,<,A)T=(\vec{G},G,<,A), where << is a total order on the edges and AA is the associated set of constraints; it is constraining when, for some compatible angle vector, the corresponding strict system is insoluble while the associated homogeneous system has a nontrivial solution.

Constraining conjecture. For every minimal simply three edge connected, totally cyclic directed graph G⃗\vec{G}, there is a total order << and a constraining twisted graph T=(G⃗,G,<,A)T=(\vec{G},G,<,A).

The paper presents this as a weaker consequence of the preceding conjectures, via its twistability lemma. It remains an open proposed sufficient condition for constructing the relevant line arrangements.

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.