Search Results for ""

Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

A curve is simple if it does not cross itself.

The set St^_v-Stv, where St^_v is a closed star and Stv is a star, is called the link of v in a simplicial complex K and is denoted Lkv (Munkres 1993, p. 11).

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

A smooth map f:S^1->R^3 whose image has singularities. In particular, in the theory of Vassiliev's knot invariants, singular knots with a finite number of ordinary double ...

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

Consider (1) If the probability distribution is governed by a Markov process, then P_3(y_1,t_1;y_2,t_2|y_3,t_3) = P_2(y_2,t_2|y_3,t_3) (2) = P_2(y_2|y_3,t_3-t_2). (3) ...

F(x) = Li_2(1-x) (1) = int_(1-x)^0(ln(1-t))/tdt, (2) where Li_2(x) is the dilogarithm.

An n×n array is called a square array. Considered as a matrix, a square array is called a square matrix.