The number of fixed points of the majority rule

DOI10.1016/0012-365X(88)90005-2zbMath0659.05004MaRDI QIDQ1112026

Aviezri S. Fraenkel, Shmuel T. Klein, Zvia Agur

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

majority function; cyclic binary strings; genetic information processing

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

92D10: Genetics and epigenetics

Related Items

Optimal irreversible dynamos in chordal rings, Counting dominating sets and related structures in graphs, The dynamics of conjunctive and disjunctive Boolean network models, Local event boundary detection with unreliable sensors: analysis of the majority vote scheme, On a paper of Agur, Fraenkel and Klein, The \(r\)-majority vote action on 0-1 sequences, Parametrization for stationary patterns of the \(r\)-majority operators on 0-1 sequences, Dynamic monopolies in tori., Local majorities, coalitions and monopolies in graphs: A review, Fixed points and maximal independent sets in AND-OR networks, Triggering cascades on undirected connected graphs, The number of fixed points of AND-OR networks with chain topology, On the computation of fixed points in Boolean networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamics of positive automata networks
• Periodic behaviour of generalized threshold functions
• On periodical behaviour in societies with symmetric influences
• Systems of Numeration
• Comportement itératif des fonctions à multiseuil