Search Results for ""

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...

If f(x)=f_0+f_1x+f_2x^2+...+f_nx^n+..., (1) then S(n,j)=f_jx^j+f_(j+n)x^(j+n)+f_(j+2n)x^(j+2n)+... (2) is given by S(n,j)=1/nsum_(t=0)^(n-1)w^(-jt)f(w^tx), (3) where ...

The surface corresponding to the region of obscuration when a solid is illuminated from a point light source (located at the radiant point). A disk is the shadow of a sphere ...

A family composed of countably many discrete families.

A family composed of countably many locally finite families.

A curve is simple if it does not cross itself.

A simple path is a path which is a simple curve. More precisely, a continuous mapping gamma:[a,b]->C^0 is a simple path if it has no self-intersections. Here, C^0 denotes the ...

A relationship between knot polynomials for links in different orientations (denoted below as L_+, L_0, and L_-). J. H. Conway was the first to realize that the Alexander ...

Let H be a two-dimensional distribution function with marginal distribution functions F and G. Then there exists a copula C such that H(x,y)=C(F(x),G(y)). Conversely, for any ...