Search Results for ""

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

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

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

If pi on V and pi^' on V^' are irreducible representations and E:V|->V^' is a linear map such that pi^'(g)E=Epi(g) for all g in and group G, then E=0 or E is invertible. ...

There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...

The smallest statistical rank (either up or down) of a set of data.

1.5 times the H-spread.

Symmetric points are preserved under a Möbius transformation. The Schwarz reflection principle is sometimes called the symmetry principle (Needham 2000, p. 252).

The topological completion C of a field F with respect to the absolute value |·| is the smallest field containing F for which all Cauchy sequences or rationals converge.

The trimean is defined to be TM=1/4(H_1+2M+H_2), where H_i are the hinges and M is the statistical median. Press et al. (1992) call this Tukey's trimean. It is an L-estimate.