Search Results for ""

An algorithm for finding roots which retains that prior estimate for which the function value has opposite sign from the function value at the current best estimate of the ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...

A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...

The index associated to a metric tensor g on a smooth manifold M is a nonnegative integer I for which index(gx)=I for all x in M. Here, the notation index(gx) denotes the ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

The midcircle of two given circles is the circle which would invert the circles into each other. Dixon (1991) gives constructions for the midcircle for four of the five ...

Is it possible to cover completely the surface of a sphere with congruent, nonoverlapping arcs of great circles? Conway and Croft (1964) proved that it can be covered with ...

An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...