ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix NN and let G∈DC⁡NG\in\operatorname{DC}_N be a connected DC graph. Let ZG′Z'_G be the partial cyclic order obtained by requiring that, for every maximal edge (i,j)(i,j) of GG, the tuples (i,i+1,…,j)(i,i+1,\ldots,j), (i,i−1,j)(i,i-1,j) and (j,i,j+1)(j,i,j+1) are ZG′Z'_G-chains. A circular extension of ZG′Z'_G is a total cyclic order extending this partial cyclic order. Realizability conjecture. For every connected DC graph G∈DC⁡NG\in\operatorname{DC}_N, every circular extension of ZG′Z'_G arises as the total cyclic order of cursor jumps for some value of parameters (a‾,p‾)∈PG(\underline a,\underline p)\in P_G. The map from total cyclic orders to connected DC graphs is known to have fibers described by the circular extensions of ZG′Z'_G; the conjecture asks whether every order in such a fiber is realized by model parameters.

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.