2 problems

0 votes0 replies0 views
Polynomial complexity and finite quasiperiodic asymptotics conjecture for regulatory networks
Consider a discrete-time regulatory network and let $C(t)$ denote its complexity at time $t$ . Polynomial complexity and finite asymptotics conjecture. The complexity is always boun…
Conjectureopencomplexity dynamical-systems regulatory-networksarXiv posted 2 days ago
0 votes0 replies1 view
Linear complexity conjecture for the negative circuit on two vertices
Consider a negative circuit on two vertices, with parameters $(T,a)$ , complexity function $C(t)$ , and contraction rate $a$ . Linear complexity conjecture. The complexity can always…
Conjectureopendynamical-systems regulatory-networks symbolic-dynamicsarXiv posted 2 days ago

Polynomial complexity and finite quasiperiodic asymptotics conjecture for regulatory networks