Search Results for ""

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

A functor F is called covariant if it preserves the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(A)-->F(B).

A cycle double cover of an undirected graph is a collection of cycles that cover each edge of the graph exactly twice. For a polyhedral graph, the faces of a corresponding ...

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

A wavelet used for filtering signals. Daubechies (1988, p. 980) has tabulated the numerical values up to order p=10.

Let G be group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

The dihedral group D_2 is a point group that is isomorphic to the vierergruppe and the finite group C_2×C_2.

The shortest path-spanning tree from a graph vertex of a graph.

Given the direct sum of additive Abelian groups A direct sum B, A and B are called direct summands. The map i_1:A-->A direct sum B defined by i(a)=a direct sum 0 is called ...

A set S together with a relation >= which is both transitive and reflexive such that for any two elements a,b in S, there exists another element c in S with c>=a and c>=b. In ...