An extension of a combinatorial fixed point theorem of Shih and Dong
DOI10.1016/J.AAM.2007.05.006zbMATH Open1185.05027OpenAlexW2061168403MaRDI QIDQ953907FDOQ953907
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
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
discrete dynamical systemsfixed pointgenetic regulatory networksJacobian conjecturediscrete Jacobian matrixBoolean eigenvalueasynchronous automata networks
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)
Cites Work
- A combinatorial analogue of the Jacobian problem in automata networks
- Multistationarity, the basis of cell differentiation and memory. II: Logical analysis of regulatory networks in terms of feedback circuits
- Title not available (Why is that?)
- Title not available (Why is that?)
- Necessary conditions for multistationarity in discrete dynamical systems
- Discrete dynamical systems
- Solution of the Boolean Markus-Yamabe problem
- Dérivée discrete et comportement local d'une itération discrete
- Théoremes de Perron-Frobenius et Stein-Rosenberg booleens
Cited In (14)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
- Local negative circuits and fixed points in non-expansive Boolean networks
- Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components
- Complexity of fixed point counting problems in Boolean networks
- Global convergence for the XOR Boolean networks
- A combinatorial analogue of the Jacobian problem in automata networks
- Generalization of Shih-Dong's combinational fixed point theorem to finite distributive lattices
- Positive and negative cycles in Boolean networks
- On the conversion of multivalued to Boolean dynamics
- A global convergence theorem in Boolean algebra
- Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
- Negative circuits and sustained oscillations in asynchronous automata networks
- An application of a discrete fixed point theorem to a game in expansive form
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)
