Search Results for ""

The configuration formed by two curves starting at a point, called the vertex V, in a common direction. Horn angles are concrete illustrations of non-Archimedean geometries.

The central point in a wheel graph W_n. The hub has degree n-1.

y^(n/m)+c|x/a|^(n/m)-c=0, with n/m>2. If n/m<2, the curve is a hypoellipse.

y^(n/m)+c|x/a|^(n/m)-c=0, with n/m<2. If n/m>2, the curve is a hyperellipse.

Given a subset B of a set A, the injection f:B->A defined by f(b)=b for all b in B is called the inclusion map.

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

One of the basic objects treated in a given formal language system. The term is sometimes also used as a synonym for urelement.

A definition of a set by mentioning a defining property.

An invertible linear transformation T:V->W is a map between vector spaces V and W with an inverse map which is also a linear transformation. When T is given by matrix ...