Search Results for ""

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...

The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...

A discontinuity is point at which a mathematical object is discontinuous. The left figure above illustrates a discontinuity in a one-variable function while the right figure ...

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...