Search Results for ""

A nonzero element x of a ring for which x·y=0, where y is some other nonzero element and the multiplication x·y is the multiplication of the ring. A ring with no zero ...

Regge calculus is a finite element method utilized in numerical relativity in attempts of describing spacetimes with few or no symmetries by way of producing numerical ...

A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...

Let G be a permutation group on a set Omega and x be an element of Omega. Then G_x={g in G:g(x)=x} (1) is called the stabilizer of x and consists of all the permutations of G ...

If two projective pencils of curves of orders n and n^' have no common curve, the locus of the intersections of corresponding curves of the two is a curve of order n+n^' ...

Let K be a number field and let O be an order in K. Then the set of equivalence classes of invertible fractional ideals of O forms a multiplicative Abelian group called the ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

Gray (1997) defines Bour's minimal curve over complex z by x^' = (z^(m-1))/(m-1)-(z^(m+1))/(m+1) (1) y^' = i((z^(m-1))/(m-1)+(z^(m+1))/(m+1)) (2) z^' = (2z^m)/m, (3) and then ...