ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an interaction graph and let F[D,q]\mathrm{F}[D,q] denote the finite dynamical systems over an alphabet of size qq with interaction graph DD. For j∈{0,1,2}j\in\{0,1,2\}, let djd_j denote the proportion of elements of F[D,q]\mathrm{F}[D,q] having exactly jj fixed points, and let Property

assert that $d_2$ is bounded away from zero for large alphabets, while Property

asserts the corresponding lower bound for the proportion d0d_0 of fixed-point-free elements. The non-acyclic graph conjecture. Any non-acyclic graph DD satisfies Property

,andhencealsoProperty, and hence also 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 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.