TOPICS
Search

Search Results for ""


1061 - 1070 of 2903 for Minimum Total Dominating SetSearch Results
The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...
Let R be the set of all sets which are not members of themselves. Then R is neither a member of itself nor not a member of itself. Symbolically, let R={x:x not in x}. Then R ...
The Grassmannian Gr(n,k) is the set of k-dimensional subspaces in an n-dimensional vector space. For example, the set of lines Gr(n+1,1) is projective space. The real ...
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 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 ...
1 ... 104|105|106|107|108|109|110 ... 291 Previous Next

...