A combinatorial analogue of the Jacobian problem in automata networks

DOI10.1016/j.aam.2004.06.002zbMath1060.05505OpenAlexW1977513171MaRDI QIDQ1775725

Niranjan Chakravarthy

Publication date: 4 May 2005

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

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

zbMATH Keywords

Jacobian conjectureHypercubeFixed pointHamming metricBoolean eigenvalue\(k\)-subcube01-stringsAutomata networkDiscrete Jacobian matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Jacobian problem (14R15) Cellular automata (computational aspects) (68Q80) Boolean functions (06E30)

Related Items (25)

Simple dynamics on graphs ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ A circuit-preserving mapping from multilevel to Boolean dynamics ⋮ On circuit functionality in Boolean networks ⋮ Bistability and asynchrony in a Boolean model of the \textsc{L}-arabinose operon in \textit{Escherichia coli} ⋮ On Differentiation and Homeostatic Behaviours of Boolean Dynamical Systems ⋮ Hamming star-convexity packing in information storage ⋮ Efficient synthesis of a class of Boolean programs from I-O data: application to genetic networks ⋮ From kernels in directed graphs to fixed points and negative cycles in Boolean networks ⋮ Positive and negative cycles in Boolean networks ⋮ Local Negative Circuits and Cyclic Attractors in Boolean Networks with at most Five Components ⋮ On the conversion of multivalued to Boolean dynamics ⋮ Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey ⋮ Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework ⋮ Negative local feedbacks in Boolean networks ⋮ Fixed points and negative circuit free in finite lattices ⋮ An extension of a combinatorial fixed point theorem of Shih and Dong ⋮ Fixed points and connections between positive and negative cycles in Boolean networks ⋮ Negative circuits and sustained oscillations in asynchronous automata networks ⋮ Asynchronous Boolean networks and hereditarily bijective maps ⋮ Local cycles and dynamical properties of Boolean networks ⋮ Relations between gene regulatory networks and cell dynamics in Boolean models ⋮ Local negative circuits and fixed points in non-expansive Boolean networks ⋮ AN APPLICATION OF A DISCRETE FIXED POINT THEOREM TO A GAME IN EXPANSIVE FORM ⋮ Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks

Cites Work

• Unnamed Item
• Dérivée discrete et comportement local d'une itération discrete
• Itérations sur des ensembles finis et automates cellulaires contractants
• Théoremes de Perron-Frobenius et Stein-Rosenberg booleens
• Solution of the Boolean Markus-Yamabe problem
• Discrete dynamical systems

This page was built for publication: A combinatorial analogue of the Jacobian problem in automata networks