Search Results for ""

Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...

Integers (lambda,mu) for a and b that satisfy Bézout's identity lambdaa+mub=GCD(a,b) are called Bézout numbers. For integers a_1, ..., a_n, the Bézout numbers are a set of ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

A coaxal system is a system of coaxal circles. A spectacular example is the set of circles (circumcircle, nine-point circle, orthocentroidal circle, orthoptic circle of the ...

Two elements x and y of a set S are said to be commutative under a binary operation * if they satisfy x*y=y*x. (1) Real numbers are commutative under addition x+y=y+x (2) and ...

Let mu be a positive measure on a sigma-algebra M, and let lambda be an arbitrary (real or complex) measure on M. If there is a set A in M such that lambda(E)=lambda(A ...

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 ...

Let A be any algebra over a field F, and define a derivation of A as a linear operator D on A satisfying (xy)D=(xD)y+x(yD) for all x,y in A. Then the set D(A) of all ...

The metric g defined on a nonempty set X by g(x,x) = 0 (1) g(x,y) = 1 (2) if x!=y for all x,y in X. It follows that the open ball of radius r>0 and center at x_0 B(x_0,r)={x ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...