Search Results for ""

Members of a coaxal system satisfy x^2+y^2+2lambdax+c=(x+lambda)^2+y^2+c-lambda^2=0 for values of lambda. Picking lambda^2=c then gives the two circles (x+/-sqrt(c))^2+y^2=0 ...

Every bounded operator T acting on a Hilbert space H has a decomposition T=U|T|, where |T|=(T^*T)^(1/2) and U is a partial isometry. This decomposition is called polar ...

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...

A point at which three or more polyhedron edges of a polyhedron meet. The concept can also be generalized to a polytope.

Polynomial identities involving sums and differences of like powers include x^2-y^2 = (x-y)(x+y) (1) x^3-y^3 = (x-y)(x^2+xy+y^2) (2) x^3+y^3 = (x+y)(x^2-xy+y^2) (3) x^4-y^4 = ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

At each point on a given a two-dimensional surface, there are two "principal" radii of curvature. The larger is denoted R_1, and the smaller R_2. The "principal directions" ...

A data structure designed to allow repeated extraction of the smallest remaining key (Skiena 1990, p. 38).

Any geometric correlation which transforms one range into a projectively related pencil (or vice versa).

A proper subset S^' of a set S, denoted S^' subset S, is a subset that is strictly contained in S and so necessarily excludes at least one member of S. The empty set is ...