Search Results for ""

Let V be a variety, and write G(V) for the set of divisors, G_l(V) for the set of divisors linearly equivalent to 0, and G_a(V) for the group of divisors algebraically equal ...

A singular point such that every neighborhood of the point intersects itself. Pinch points are also called Whitney singularities or branch points.

Let x:p(x)->xp(x), then for any operator T, T^'=Tx-xT is called the Pincherle derivative of T. If T is a shift-invariant operator, then its Pincherle derivative is also a ...

rho_n(nu,x)=((1+nu-n)_n)/(sqrt(n!x^n))_1F_1(-n;1+nu-n;x), where (a)_n is a Pochhammer symbol and _1F_1(a;b;z) is a confluent hypergeometric function of the first kind.

Every bounded operator T acting on a Hilbert space H has a decomposition T=U|T|, where |T|=(T^*T)^(1/2) and U is a partial isometry. This decomposition is called polar ...

A point at which three or more polyhedron edges of a polyhedron meet. The concept can also be generalized to a polytope.

Let X_1 and X_2 be the number of successes in variates taken from two populations. Define p^^_1 = (x_1)/(n_1) (1) p^^_2 = (x_2)/(n_2). (2) The estimator of the difference is ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

A premise is a statement that is assumed to be true. Formal logic uses a set of premises and syllogisms to arrive at a conclusion.

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...