Search Results for ""

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.

A topological space having a countable dense subset. An example is the Euclidean space R^n with the Euclidean topology, since it has the rational lattice Q^n as a countable ...

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

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 ...

Two distinct point pairs AC and BD separate each other if A, B, C, and D lie on a circle (or line) in such order that either of the arcs (or the line segment AC) contains one ...

There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...

An algebraic surface of degree 7. The Labs septic is an example of a septic surface.

The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...