Realizability of circular extensions for connected DC graphs
Statement
Fix and let be a connected DC graph. Let be the partial cyclic order obtained by requiring that, for every maximal edge of , the tuples , and are -chains. A circular extension of is a total cyclic order extending this partial cyclic order. Realizability conjecture. For every connected DC graph , every circular extension of arises as the total cyclic order of cursor jumps for some value of parameters . The map from total cyclic orders to connected DC graphs is known to have fibers described by the circular extensions of ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.