Search Results for ""

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

An extended form of Bürmann's theorem. Let f(z) be a function of z analytic in a ring-shaped region A, bounded by another curve C and an inner curve c. Let theta(z) be a ...

A topological space M satisfying some separability (i.e., it is a T2-space) and countability (i.e., it is a paracompact space) conditions such that every point p in M has a ...

The 2-point Newton-Cotes formula int_(x_1)^(x_2)f(x)dx=1/2h(f_1+f_2)-1/(12)h^3f^('')(xi), where f_i=f(x_i), h is the separation between the points, and xi is a point ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

The study of the probabilities involved in geometric problems, e.g., the distributions of length, area, volume, etc. for geometric objects under stated conditions. The ...

The graph diameter of a graph is the length max_(u,v)d(u,v) of the "longest shortest path" (i.e., the longest graph geodesic) between any two graph vertices (u,v), where ...