A simple proof of a necessary and sufficient condition for absolute stability of symmetric neural networks

1998 ◽  
Vol 45 (9) ◽  
pp. 1010-1011 ◽  
Author(s):  
Xue-Bin Liang ◽  
Li-De Wu
Keyword(s):  
Neural Networks ◽  
Simple Proof ◽  
Absolute Stability ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

scholarly journals Sufficient conditions for matchings

1972 ◽  
Vol 18 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Ian Anderson
Keyword(s):  
Simple Proof ◽  
Perfect Matching ◽  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Number Of Components ◽  
Image Position ◽  
Necessary And Sufficient

A graph G is said to possess a perfect matching if there is a subgraph of G consisting of disjoint edges which together cover all the vertices of G. Clearly G must then have an even number of vertices. A necessary and sufficient condition for G to possess a perfect matching was obtained by Tutte (3). If S is any set of vertices of G, let p(S) denote the number of components of the graph G – S with an odd number of vertices. Then the conditionis both necessary and sufficient for the existence of a perfect matching. A simple proof of this result is given in (1).

scholarly journals A Characterization of Invariant Affine Connections

1960 ◽  
Vol 16 ◽  
pp. 35-50 ◽  
Author(s):  
Bertram Kostant
Keyword(s):  
Riemannian Manifold ◽  
Simple Proof ◽  
General Theorem ◽  
Transitive Group ◽  
Complete Riemannian Manifold ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient ◽  
Simply Connected

1. Introduction and statement of theorem. 1. In [1] Ambrose and Singer gave a necessary and sufficient condition (Theorem 3 here) for a simply connected complete Riemannian manifold to admit a transitive group of motions. Here we shall give a simple proof of a more general theorem — Theorem 1 (the proof of Theorem 1 became suggestive to us after we noted that the Tx of [1] is just the ax of [6] when X is restricted to p0, see [6], p. 539).

Sign in / Sign up

Export Citation Format

Share Document