Search Results for ""

A ruled surface is called a generalized cone if it can be parameterized by x(u,v)=p+vy(u), where p is a fixed point which can be regarded as the vertex of the cone. A ...

In population studies, the direct offspring of a reference population (roughly) constitutes a single generation. For a cellular automaton, the fundamental unit of time during ...

For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...

A cylindrical algebraic decomposition that omits sets of measure zero. Generic cylindrical algebraic decompositions are generally much quicker to compute than are normal ...

The statistical index P_G=[product((p_n)/(p_0))^(v_0)]^(1/Sigmav_0), where p_n is the price per unit in period n, q_n is the quantity produced in period n, and v_n=p_nq_n the ...

If the abstract simplicial complex S is isomorphic with the vertex scheme of the simplicial complex K, then K is said to be a geometric realization of S, and is uniquely ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

The partial differential equation u_t=(1+ia)u_(xx)+(1+ic)u-(1+id)|u|^2u.

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...