Search Results for ""

A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...

The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...

A power series containing fractional exponents (Davenport et al. 1993, p. 91) and logarithms, where the logarithms may be multiply nested, e.g., lnlnx.

Given a polynomial in a single complex variable with complex coefficients p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, the reciprocal polynomial is defined by ...

A reduced root system is a root system R satisfying the additional property that, if alpha in R, then the only multiples of alpha in R are +/-alpha.

A set of methods that are generally superior to ANOVA for small data sets or where sample distributions are non-normal.

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

Let m and m+h be two consecutive critical indices of f and let F be (m+h)-normal. If the polynomials p^~_k^((n)) are defined by p^~_0^((n))(u) = 1 (1) p^~_(k+1)^((n))(u) = ...

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