Search Results for ""

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...

The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...

The point S^' which makes the perimeters of the triangles DeltaBS^'C, DeltaCS^'A, and DeltaAS^'B equal. The isoperimetric point exists iff a+b+c>4R+r, (1) where a, b, and c ...

Given a sequence S_i as input to stage i, form sequence S_(i+1) as follows: 1. For k in [1,...,i], write term i+k and then term i-k. 2. Discard the ith term. 3. Write the ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

On a measure space X, the set of square integrable L2-functions is an L^2-space. Taken together with the L2-inner product with respect to a measure mu, <f,g>=int_Xfgdmu (1) ...

Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

A pair of linear operators L and A associated with a given partial differential equation which can be used to solve the equation. However, it turns out to be very difficult ...