Search Results for ""

Numerical differentiation is the process of finding the numerical value of a derivative of a given function at a given point. In general, numerical differentiation is more ...

For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...

A crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...

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

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

There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...