TOPICS
Search

Search Results for ""


631 - 640 of 1443 for Decomposition GroupSearch Results
Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...
A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...
For an atomic integral domain R (i.e., one in which every nonzero nonunit can be factored as a product of irreducible elements) with I(R) the set of irreducible elements, the ...
A property of finite simple groups which is known for all such groups.
The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...
If a Sylow 2-subgroup T of G lies in a unique maximal 2-local P of G, then P is a "strongly embedded" subgroup of G, and G is known.
A Lie groupoid over B is a groupoid G for which G and B are differentiable manifolds and alpha,beta and multiplication are differentiable maps. Furthermore, the derivatives ...
First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...
Given a real m×n matrix A, there are four associated vector subspaces which are known colloquially as its fundamental subspaces, namely the column spaces and the null spaces ...
Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...
1 ... 61|62|63|64|65|66|67 ... 145 Previous Next

...