Search Results for ""

On the Clebsch diagonal cubic, all 27 of the complex lines present on a general smooth cubic surface are real. In addition, there are 10 points on the surface where three of ...

A pair of values x and y one or both of which is complex.

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

A pole of multiplicity less than p+1.

Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...

Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...

In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...

Let A_(k,i)(n) denote the number of partitions into n parts not congruent to 0, i, or -i (mod 2k+1). Let B_(k,i)(n) denote the number of partitions of n wherein 1. 1 appears ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

A beautiful general theorem of which the following two statements are special cases (Coxeter and Greitzer 1967, pp. 99-100). 1. If DeltaABC and DeltaA^'B^'C^' are two ...