ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let one of the three network models described in the paper be fixed, let c∈Cc\in\mathbb{C} be the equi-parameter, and denote the corresponding uni-J set and equi-M set by the network's uni-J and equi-M sets.

Connectedness conjecture. For any of the three models described, and for any equi-parameter c∈Cc\in\mathbb{C}, the uni-J set is connected only if cc is in the equi-M set of the network, and it is totally disconnected only if cc is not in the equi-M set of the network.

This conjecture proposes a connectedness dichotomy for uni-J sets in the three coupled logistic-map models, while allowing intermediate cases with finitely or infinitely many connected components that are not totally disconnected. Its status is not established by the supplied source context.

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.