Search Results for ""

The union of two sets A and B is the set obtained by combining the members of each. This is written A union B, and is pronounced "A union B" or "A cup B." The union of sets ...

A square matrix A is said to be unipotent if A-I, where I is an identity matrix is a nilpotent matrix (defined by the property that A^n is the zero matrix for some positive ...

A unique factorization domain, called UFD for short, is any integral domain in which every nonzero noninvertible element has a unique factorization, i.e., an essentially ...

A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...

A theorem, also called a unicity theorem, stating the uniqueness of a mathematical object, which usually means that there is only one object fulfilling given properties, or ...

A uniform-density polyhedral solid is unistable (also called monostable) if it is stable on exactly one face (Croft et al. 1991, p. 61). For example, the 19-faced polyhedron ...

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 is an element in a ring that has a multiplicative inverse. If a is an algebraic integer which divides every algebraic integer in the field, a is called a unit in that ...

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