Search Results for ""

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

A simple function is a finite sum sum_(i)a_ichi_(A_i), where the functions chi_(A_i) are characteristic functions on a set A. Another description of a simple function is a ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

A simple group is a group whose only normal subgroups are the trivial subgroup of order one and the improper subgroup consisting of the entire original group. Simple groups ...

Simple harmonic motion refers to the periodic sinusoidal oscillation of an object or quantity. Simple harmonic motion is executed by any quantity obeying the differential ...

Given a simple harmonic oscillator with a quadratic perturbation, write the perturbation term in the form alphaepsilonx^2, x^..+omega_0^2x-alphaepsilonx^2=0, (1) find the ...

Interest which is paid only on the principal and not on the additional amount generated by previous interest payments. A formula for computing simple interest is ...

A Lie algebra is said to be simple if it is not Abelian and has no nonzero proper ideals. Over an algebraically closed field of field characteristic 0, every simple Lie ...

A simple path is a path which is a simple curve. More precisely, a continuous mapping gamma:[a,b]->C^0 is a simple path if it has no self-intersections. Here, C^0 denotes the ...

A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...