Search Results for ""

Theory of Computation

Written in the notation of partial derivatives, the d'Alembertian square ^2 in a flat spacetime is defined by square ^2=del ^2-1/(c^2)(partial^2)/(partialt^2), where c is the ...

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

Let a group G have a group presentation G=<x_1,...,x_n|r_j(x_1,...,x_n),j in J> so that G=F/R, where F is the free group with basis {x_1,...,x_n} and R is the normal subgroup ...

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

A Banach space is a complete vector space B with a norm ||·||. Two norms ||·||_((1)) and ||·||_((2)) are called equivalent if they give the same topology, which is equivalent ...

The subset B of the Euclidean plane formed by the union of the interval [0,1] of the x-axis and all line segments of unit length passing through the origin which form an ...

The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...

The word "class" has many specialized meanings in mathematics in which it refers to a group of objects with some common property (e.g., characteristic class or conjugacy ...