TOPICS
Search

Search Results for ""


6401 - 6410 of 13135 for Computational GeometrySearch Results
A group G is nilpotent if the upper central sequence 1=Z_0<=Z_1<=Z_2<=...<=Z_n<=... of the group terminates with Z_n=G for some n. Nilpotent groups have the property that ...
There are two equivalent definitions for a nilpotent matrix. 1. A square matrix whose eigenvalues are all 0. 2. A square matrix A such that A^n is the zero matrix 0 for some ...
A pile of counters in a game of nim. The nim-heap illustrated above corresponds to the game of Marienbad.
Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...
A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.
Let M be a finitely generated module over a commutative Noetherian ring R. Then there exists a finite set {N_i|1<=i<=l} of submodules of M such that 1. intersection ...
A module M is Noetherian if it obeys the ascending chain condition with respect to inclusion, i.e., if every set of increasing sequences of submodules eventually becomes ...
A group or other algebraic object is called non-Abelian if the law of commutativity does not always hold, i.e., if the object is not Abelian. For example, the group of ...
An algebra which does not satisfy a(bc)=(ab)c is called a nonassociative algebra.
The number of nonassociative n-products with k elements preceding the rightmost left parameter is F(n,k) = F(n-1,k)+F(n-1,k-1) (1) = (n+k-2; k)-(n+k-1; k-1), (2) where (n; k) ...
1 ... 638|639|640|641|642|643|644 ... 1314 Previous Next

...