Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...

A test to determine if a given series converges or diverges.

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

A discrete group is a topological group with the discrete topology. Often in practice, discrete groups arise as discrete subgroups of continuous Lie groups acting on a ...

The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...

A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...

A point traced out twice as a closed curve is traversed. The maximum number of double points for a nondegenerate quartic curve is three. An ordinary double point is also ...

Based on a problem in particle physics, Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) is the multinomial ...