Search Results for ""

Let V be a complete normal variety, and write G(V) for the group of divisors, G_n(V) for the group of divisors numerically equal to 0, and G_a(V) the group of divisors ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

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 ...

A noncommutative ring R is a ring in which the law of multiplicative commutativity is not satisfied, i.e., a·b!=b·a for any two elements a,b in R. In such a case, the ...

A subset E of a topological space S is said to be nonmeager if E is of second category in S, i.e., if E cannot be written as the countable union of subsets which are nowhere ...

An impartial game in which the last player wins. In normal-form games, the nim-value of the sum of two games is the nim-sum of their nim-values.

A normal extension is the splitting field for a collection of polynomials. In the case of a finite algebraic extension, only one polynomial is necessary.

Let G be a group with normal series (A_0, A_1, ..., A_r). A normal factor of G is a quotient group A_(k+1)/A_k for some index k<r. G is a solvable group iff all normal ...

The O'Nan group is the sporadic group O'N of order |O'N| = 460815505920 (1) = 2^9·3^4·5·7^3·11·19·31. (2) It is implemented in the Wolfram Language as ONanGroupON[].

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.