Search Results for ""

A semiprime ring which is also an Artinian ring.

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

A morphism f:X->Y is said to be separable if K(X) is a separable extension of K(Y).

A polynomial with coefficients in a field is separable if its factors have distinct roots in some extension field.

Given a subalgebra A of the algebra B(H) of bounded linear transformations from a Hilbert space H onto itself, the vector v in H is a separating vector for A if the only ...

A knot used to shorten a long rope.

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

A nonzero ring S whose only (two-sided) ideals are S itself and zero. Every commutative simple ring is a field. Every simple ring is a prime ring.