Search Results for ""

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...

A catastrophe which can occur for four control factors and one behavior axis. The butterfly catastrophe is the universal unfolding of the singularity f(x)=x^6 of codimension ...

There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...

A cipher is an algorithm that converts data (plaintext) to an obfuscated form that is not directly readable. Ciphers are usually used with the intention of hiding the ...

Two complex numbers x=a+ib and y=c+id are multiplied as follows: xy = (a+ib)(c+id) (1) = ac+ibc+iad-bd (2) = (ac-bd)+i(ad+bc). (3) In component form, ...

The conchoid of de Sluze is the cubic curve first constructed by René de Sluze in 1662. It is given by the implicit equation (x-1)(x^2+y^2)=ax^2, (1) or the polar equation ...

Ellipses sharing common foci (left figure). The family of confocal ellipses covers the plane simply, in the sense that there is a unique ellipse passing through each point in ...