Search Results for ""

A tree decomposition is a mapping of a graph into a related tree with desirable properties that allow it to be used to efficiently compute certain properties (e.g., ...

A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y. (2) Then A is said to be alternative if, for all x,y in A, (x·y)·y=x·(y·y) (3) ...

A function f(x) is said to be antiperiodic with antiperiod p if -f(x)=f(x+np) for n=1, 3, .... For example, the sine function sinx is antiperiodic with period pi (as well as ...

A function whose range is in the complex numbers is said to be a complex function, or a complex-valued function.

A variable that may assume complex values.

Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...

Factor analysis allows the determination of common axes influencing sets of independent measured sets. It is "the granddaddy of multivariate techniques (Gould 1996, pp. ...

The unit lower half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]<0}.