Search Results for ""

The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...

A torus with a hole that can eat another torus. The transformation is continuous, and so can be achieved by stretching only without tearing or making new holes in the tori.

Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...

A transformation of a polynomial equation f(x)=0 which is of the form y=g(x)/h(x) where g and h are polynomials and h(x) does not vanish at a root of f(x)=0. The cubic ...

The union of two sets A and B is the set obtained by combining the members of each. This is written A union B, and is pronounced "A union B" or "A cup B." The union of sets ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

An operation that takes two vector bundles over a fixed space and produces a new vector bundle over the same space. If E_1 and E_2 are vector bundles over B, then the Whitney ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...

Given two additive groups (or rings, or modules, or vector spaces) A and B, the map f:A-->B such that f(a)=0 for all a in A is called the zero map. It is a homomorphism in ...