Search Results for ""

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...

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) ...

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

A map is called bijective if it is both injective and surjective. A bijective map is also called a bijection. A function f admits an inverse f^(-1) (i.e., "f is invertible") ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

A hyperfunction, discovered by Mikio Sato in 1958, is defined as a pair of holomorphic functions (f,g) which are separated by a boundary gamma. If gamma is taken to be a ...

The general sextic equation x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 can be solved in terms of Kampé de Fériet functions, and a restricted class of sextics can be solved in ...

An operator defined on a set S which takes two elements from S as inputs and returns a single element of S. Binary operators are called compositions by Rosenfeld (1968). Sets ...