The non-acyclic graph conjecture on average instability
Statement
Let be an interaction graph and let denote the finite dynamical systems over an alphabet of size with interaction graph . For , let denote the proportion of elements of having exactly fixed points, and let Property
assert that $d_2$ is bounded away from zero for large alphabets, while Propertyasserts the corresponding lower bound for the proportion of fixed-point-free elements. The non-acyclic graph conjecture. Any non-acyclic graph satisfies Property
. This would imply that the average instability is bounded away from zero for large alphabets. The first assertion is stated as stronger than the second, and the paper provides supporting examples but does not resolve the conjecture in general.
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.