Search Results for ""

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A rotation combined with an expansion or geometric contraction.

The Reidemeister move of type I.

psi=(A_0+alpha_1A_1+alpha_2A_2+...)e^(iS/alpha).

A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.

A set of sample problems in unconstrained optimization is given by loading Optimization`UnconstrainedProblems` and evaluating $FindMinimumProblems.

In the American system, 10^(36).

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

The property of being the only possible solution (perhaps modulo a constant, class of transformation, etc.).

A ball of radius 1.