The strong-edge conjecture for graphs of dynamical systems
Statement
Let be a dynamical system with a compact global attractor. An edge of the graph of is called strong when it satisfies the source's strong-edge relation. Strong-edge conjecture. Every edge of the graph of is strong. If true, this would rule out weak edges in graphs of systems with compact global attractors; the source reports that no counterexample was found but gives no proof.
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.