Search Results for ""

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].

A vaguely defined branch of mathematics dealing with varieties, the Mordell conjecture, Arakelov theory, and elliptic curves.

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

A subset B of a vector space E is said to be balanced if lambdaB subset= B whenever lambda is a scalar satisfying |lambda|<=1. Here, the notation lambdaB denotes the set ...

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

Let K_1 be a torus knot. Then the satellite knot with companion knot K_2 is a cable knot on K_2.