Search Results for ""

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

If a function analytic at the origin has no singularities other than poles for finite x, and if we can choose a sequence of contours C_m about z=0 tending to infinity such ...

Let g(x_1,...,x_n,y) be a function such that for any x_1, ..., x_n, there is at least one y such that g(x_1,...,x_n,y)=0. Then the mu-operator muy(g(x_1,...,x_n,y)=0) gives ...

Müntz's theorem is a generalization of the Weierstrass approximation theorem, which states that any continuous function on a closed and bounded interval can be uniformly ...

A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...

The multinomial coefficients (n_1,n_2,...,n_k)!=((n_1+n_2+...+n_k)!)/(n_1!n_2!...n_k!) (1) are the terms in the multinomial series expansion. In other words, the number of ...

Consider a reference triangle DeltaABC with circumcenter O and orthocenter H, and let DeltaA^*B^*C^* be its reflection triangle. Then Musselman's theorem states that the ...

Polynomials s_k(x;a) which form the Sheffer sequence for g(t) = ((e^t-1)/t)^(-a) (1) f(t) = e^t-1 (2) which have generating function ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

Define the harmonic mean of the divisors of n H(n)=(sigma_0(n))/(sum_(d|n)1/d), where sigma_0(n) is the divisor function (the number of divisors of n). For n=1, 2, ..., the ...