Search Results for ""

Let f:R×R->R be a one-parameter family of C^3 maps satisfying f(0,0) = 0 (1) [(partialf)/(partialx)]_(mu=0,x=0) = -1 (2) [(partial^2f)/(partialx^2)]_(mu=0,x=0) < 0 (3) ...

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...

A strophoid of a circle with the pole O at the center of the circle and the fixed point P on the circumference of the circle. Freeth (1878, pp. 130 and 228) described this ...

Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

A global field is either a number field, a function field on an algebraic curve, or an extension of transcendence degree one over a finite field. From a modern point of view, ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...