ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a dynamical system with a compact global attractor. An edge of the graph of FF is called strong when it satisfies the source's strong-edge relation. Strong-edge conjecture. Every edge of the graph of FF 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 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.