An extension of a combinatorial fixed point theorem of Shih and Dong

DOI10.1016/J.AAM.2007.05.006MaRDI QIDQ953907zbMATH OpenOpenAlexFDO

Authors Adrien Richard

Publication date 6 November 2008

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2007.05.006

zbMATH Keywords

discrete dynamical systemsfixed pointgenetic regulatory networksJacobian conjecturediscrete Jacobian matrixBoolean eigenvalueasynchronous automata networks

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Cellular automata (computational aspects) (68Q80) Genetics and population dynamics (92D99) Boolean functions (06E30) Jacobian problem (14R15) Topological dynamics (37B99)

Recommendations

• Generalization of Shih-Dong's combinational fixed point theorem to finite distributive lattices
• A combinatorial analogue of the Jacobian problem in automata networks
• Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
• A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks
• Global convergence for the XOR Boolean networks

Cites work

• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• scientific article; zbMATH DE number 50840 (Why is no real title available?)
• A combinatorial analogue of the Jacobian problem in automata networks
• Discrete dynamical systems
• Dérivée discrete et comportement local d'une itération discrete
• Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits
• Necessary conditions for multistationarity in discrete dynamical systems
• Solution of the Boolean Markus-Yamabe problem
• Théoremes de Perron-Frobenius et Stein-Rosenberg booleens

Cited in

(16)

• Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
• Local negative circuits and cyclic attractors in Boolean networks with at most five components
• Generalization of Shih-Dong's combinational fixed point theorem to finite distributive lattices
• Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
• An application of a discrete fixed point theorem to a game in expansive form
• From kernels in directed graphs to fixed points and negative cycles in Boolean networks
• A global convergence theorem in Boolean algebra
• Positive and negative cycles in Boolean networks
• Global convergence for the XOR Boolean networks
• Negative circuits and sustained oscillations in asynchronous automata networks
• Local negative circuits and fixed points in non-expansive Boolean networks
• Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
• A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks
• A combinatorial analogue of the Jacobian problem in automata networks
• On the conversion of multivalued to Boolean dynamics
• Complexity of fixed point counting problems in Boolean networks

This page was built for publication: An extension of a combinatorial fixed point theorem of Shih and Dong

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953907)