Search Results for ""

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...

Let K subset V subset S^3 be a knot that is geometrically essential in a standard embedding of the solid torus V in the three-sphere S^3. Let K_1 subset S^3 be another knot ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

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

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

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