4 problems

Let $(\Theta(V,E), \mathbf{\Sigma})$ be a constrained switching system, where $V$ is the vertex set, $E$ is the edge set, and $\mathbf{\Sigma}$ is the associated set of system matr…

Parameter graph equivalence conjecture. The geometric and combinatorial parameter graphs are equivalent. The equivalence is proved in the paper for regulatory networks whose nodes…

Maximal-growth trajectory conjecture. For a generic discrete-time system, there exists a trajectory $x(k)$ such that

Resonance-degree conjecture. For a generic discrete-time system, there exist constants $C_1,C_2>0$ such that