Search Results for ""

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

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 be a set. An operation on A is a function from a power of A into A. More precisely, given an ordinal number alpha, a function from A^alpha into A is an alpha-ary ...

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.

In any tree, the number of dissimilar points minus the number of dissimilar lines plus the number of symmetry lines equals 1.

The number of outward directed graph edges from a given graph vertex in a directed graph.