Search Results for ""

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

A number h which satisfies the conditions of the congruum problem: x^2+h=a^2 and x^2-h=b^2, where x,h,a,b are integers. The list of congrua is given by 24, 96, 120, 240, 336, ...

A group having continuous group operations. A continuous group is necessarily infinite, since an infinite group just has to contain an infinite number of elements. But some ...

The region 0<sigma<1, where sigma is defined as the real part of a complex number s=sigma+it. All nontrivial zeros (i.e., those not at negative even integers) of the Riemann ...

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

Let the absolute frequencies of occurrence of an event in a number of class intervals be denoted f_1, f_2, .... The cumulative frequency corresponding to the upper boundary ...

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...