Search Results for ""

A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...

A right or left ideal of a ring. The term is used especially in noncommutative rings to denote a right ideal that is not a left ideal, or conversely.

Let A:D(A)->H and B:D(B)->H be linear operators from domains D(A) and D(B), respectively, into a Hilbert space H. It is said that B extends A if D(A) subset D(B) and if Bv=Av ...

An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

Two representations of a group chi_i and chi_j are said to be orthogonal if sum_(R)chi_i(R)chi_j(R)=0 for i!=j, where the sum is over all elements R of the representation.

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. An outer automorphism of G is an automorphism which cannot ...

A particular type of automorphism group which exists only for groups. For a group G, the outer automorphism group is the quotient group Aut(G)/Inn(G), which is the ...

A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...

For a partial order, the size of the longest chain is called the length.