Search Results for ""

A unit-distance embedding is a graph embedding in which all edges have unit length. A graph possessing a unit-distance embedding in two dimensions is called a unit-distance ...

A unit matrix is an integer matrix consisting of all 1s. The m×n unit matrix is often denoted J_(mn), or J_n if m=n. Square unit matrices J_n have determinant 0 for n>=2. An ...

A distance graph with distance set (0,1].

A unit vector is a vector of length 1, sometimes also called a direction vector (Jeffreys and Jeffreys 1988). The unit vector v^^ having the same direction as a given ...

A natural transformation Phi_Y:B(AY)->Y is called unital if the leftmost diagram above commutes. Similarly, a natural transformation Psi_Y:Y->A(BY) is called unital if the ...

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