Search Results for ""

Let A be a C^*-algebra having no unit. Then A^~=A direct sum C as a vector spaces together with 1. (a,lambda)+(b,mu)=(a+b,lambda+mu). 2. mu(a,lambda)=(mua,mulambda). 3. ...

In predicate calculus, a universal formula is a prenex normal form formula (i.e., a formula written as a string of quantifiers and bound variables followed by a ...

Let h:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) be efficiently computable by an algorithm (solving a P-problem). For fixed y in {0,1}^(l(n)), view h(x,y) as a function h_y(x) of x ...

A topological space that contains a homeomorphic image of every topological space of a certain class. A metric space U is said to be universal for a family of metric spaces M ...

Universality is the property of being able to perform different tasks with the same underlying construction just by being programmed in a different way. Universal systems are ...

An unordered pair representation is a representation of an undirected graph in which edges are specified as unordered pairs of vertex indices. The unordered pairs ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper half-plane is the portion of the complex plane {x+iy:x,y in (-infty,infty)} satisfying y=I[z]>0 i.e., {x+iy:x in (-infty,infty),y in (0,infty)}. Common notations ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...