Connectedness conjecture for uni-Julia sets of coupled logistic-map networks
Statement
Let one of the three network models described in the paper be fixed, let 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 , the uni-J set is connected only if is in the equi-M set of the network, and it is totally disconnected only if 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.