Almost-complete realisation conjecture for excitable CTRNN networks
Statement
Let be a directed graph with vertices satisfying the hypotheses in Theorem 1. Assume that is small and . Let the input-free CTRNN have cells, piecewise affine activation function , and connection weights defined as in the paper. Almost-complete realisation conjecture. There exists such that, for every , there is an open set of parameters for which the dynamics contains an excitable network attractor with threshold giving an almost complete realisation of . The conjecture strengthens the theorem by asserting an almost complete, rather than merely topological, realisation through an appropriate open choice of parameters; the source does not provide a resolution, so its status remains open.
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.