Search Results for ""

A knot K is an n-embeddable knot if it can be placed on a genus n standard embedded surface without crossings, but K cannot be placed on any standardly embedded surface of ...

A set which contains a nonnegative integral number of elements is said to be finite. A set which is not finite is said to be infinite. A finite or countably infinite set is ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

A framework is called "just rigid" if it is rigid, but ceases to be so when any single bar is removed. Lamb (1928, pp. 93-94) proved that a necessary (but not sufficient) ...

Multisection of a mathematical quantity or figure is division of it into a number of (usually) equal parts. Division of a quantity into two equal parts is known as bisection, ...

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

The term cube is used in topology to denote the Cartesian product of any (finite or infinite) number of copies of the closed interval [0,1] equipped with the product topology ...