3 problems

Conjecture on the terminal-component size. The right lower bound for the size of $A$ is

Let $D$ be an interaction graph and let $\mathrm{F}[D,q]$ denote the finite dynamical systems over an alphabet of size $q$ with interaction graph $D$. For $j\in\{0,1,2\}$, let…

For integers $k$ and $n$, let $\operatorname{Neck}(k,n)$ be the directed graph whose vertices are $(k,n)$-necklaces and whose transition map is $T$. A cycle in this graph is a peri…