Solution of the Boolean Markus–Yamabe Problem
✍ Scribed by Mau-Hsiang Shih; Juei-Ling Ho
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 244 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
✦ Synopsis
The main point in the design of content addressable memory would be under what conditions the state possessing the total information can attract all other states in the phase of the system. The problem can be formulated as a global asymptotic stability problem of Boolean dynamical systems. In this article we give a complete answer to this global asymptotic stability problem. The conditions employed involve the Hamming distance on the phase space 0 1 n as well as the spectral condition on the Jacobian Boolean matrix of F 0 1 n → 0 1 n evaluated at each point of 0 1 n . This article furnishes a complete solution of the Boolean Markus-Yamabe problem.
📜 SIMILAR VOLUMES
In the early 1930s, Robbins asked whether a certain equation together with commutativity and associativity of the union operation was sufficient to characterize Boolean algebras. In 1992, Winker reduced this to the problem of proving the solvability of another equation from Robbins' axioms. In Octob
We characterize the primitives of the minimal extension of the Lebesgue integral which also integrates the derivatives of differentiable functions (called the Cintegral). Then we prove that each BV function is a multiplier for the C-integral and that the product of a derivative and a BV function is