The number of fixed points of the majority rule (Q1112026): Difference between revisions

The authors consider cyclic binary strings which are transformed according the majority rule. They prove that the strings are invariant under this transformation if and only if it contains no single 1 between two zeros and no single 0 between two ones. Formulae are derived for the number of such strings; they are related to Fibonacci numbers. The problem is connected with information processing in genetics.