Search Results for ""

Also called indiscrete topology, the trivial topology is the smallest topology on a set X, namely the one in which the only open sets are the empty set and the entire set X. ...

The function psi(x)={x(1-(x^2)/(c^2))^2 for |x|<c; 0 for |x|>c (1) sometimes used in robust estimation. It has a minimum at x=-c/sqrt(5) and a maximum at x=c/sqrt(5), where ...

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...

A random number which lies within a specified range (which can, without loss of generality, be taken as [0, 1]), with a uniform distribution.

A normed vector space X=(X,||·||_X) is said to be uniformly convex if for sequences {x_n}={x_n}_(n=1)^infty, {y_n}={y_n}_(n=1)^infty, the assumptions ||x_n||_X<=1, ...

A multiplicative character is called unitary if it has absolute value 1 everywhere.

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.

The point or points to which the extensions of parallel lines appear to converge in a perspective drawing.

Let theta be the angle between two vectors. If 0<theta<pi, the vectors are positively oriented. If pi<theta<2pi, the vectors are negatively oriented. Two vectors in the plane ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...