Search Results for ""

A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...

Let F(n,sigma) denote the number of permutations on the symmetric group S_n which avoid sigma in S_k as a subpattern, where "tau contains sigma as a subpattern" is ...

A singular point such that every neighborhood of the point intersects itself. Pinch points are also called Whitney singularities or branch points.

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

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

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

A set of integers that give the orders of the blocks in a Jordan canonical form, with those integers corresponding to submatrices containing the same latent root bracketed ...

The semiminor axis (also called the minor semi-axis, minor semiaxis, or minor radius) of an ellipse (or related figure) is half its extent along the shorter of the two ...

An algebraic curve of degree six. Examples include the astroid, atriphtaloid, Cayley's sextic, cornoid, cycloid of Ceva, dumbbell curve, ellipse evolute, epicycloid, Freeth's ...

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.