Search Results for ""

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

Every finite group G of order greater than one possesses a finite series of subgroups, called a composition series, such that I<|H_s<|...<|H_2<|H_1<|G, where H_(i+1) is a ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

A concordant form is an integer triple (a,b,N) where {a^2+b^2=c^2; a^2+Nb^2=d^2, (1) with c and d integers. Examples include {14663^2+111384^2=112345^2; ...

In voting theory, a Condorcet candidate is a candidate who always wins in a 2-person election but loses in larger election. For example, consider the 6-tuples of 6-sided die ...

A congruent number can be defined as an integer that is equal to the area of a rational right triangle (Koblitz 1993). Numbers (a,x,y,z,t) such that {x^2+ay^2=z^2; ...

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

The Conway polynomial del _L(x), sometimes known as the Conway-Alexander polynomial, is a modified version of the Alexander polynomial Delta_L(x) that was formulated by J. H. ...