Search Results for ""
291 - 300 of 1798 for Element OrderSearch Results
Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...
An inner automorphism of a group G is an automorphism of the form phi(g)=h^(-1)gh, where h is a fixed element of G. The automorphism of the symmetric group S_3 that maps the ...
Let X be a topological vector space and for an arbitrary point x in X, denote by N_(x) the collection of all neighborhoods of x in X. A local base at x is any set B subset ...
A positive matrix is a real or integer matrix (a)_(ij) for which each matrix element is a positive number, i.e., a_(ij)>0 for all i, j. Positive matrices are therefore a ...
The set of prime numbers, sometimes denoted P (Derbyshire 2004, p. 163), and implemented in the Wolfram Language as Primes. In the Wolfram Language, a quantity can be tested ...
A Euclidean-like space having line element ds^2=(dz^1)^2+...+(dz^p)^2-(dz^(p+1))^2-...-(dz^(p+q))^2, having dimension m=p+q (Rosen 1965). In contrast, the signs would be all ...
The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...
A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...
A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...
The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...
...
View search results from all Wolfram sites (68206 matches)

