Cycles in Collectives of Threshold Automata

We prove that cycles of length $m\ge 3$ are impossible for symmetrical connection matrices in the class of regular collectives of threshold automata, which includes finite collectives and homogeneous networks as subclasses.