Search Results for ""

A class of knots containing the class of alternating knots. Let c(K) be the link crossing number. Then for knot sum K_1#K_2 which is an adequate knot, ...

In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...

The number of ways in which a group of n with weights sum_(i=1)^(n)w_i=1 can change a losing coalition (one with sumw_i<1/2) to a winning one, or vice versa. It was proposed ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

In 1976, Coates and Wiles showed that elliptic curves with complex multiplication having an infinite number of solutions have L-functions which are zero at the relevant fixed ...

Complex infinity is an infinite number in the complex plane whose complex argument is unknown or undefined. Complex infinity may be returned by the Wolfram Language, where it ...

A complex magnification is a map of the form z|->az, where a is a positive real number, which corresponds to magnification about the origin of points in the complex plane by ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...