Search Results for ""
4501 - 4510 of 13134 for complexity theorySearch Results
In an integral domain R, the decomposition of a nonzero noninvertible element a as a product of prime (or irreducible) factors a=p_1...p_n, (1) is unique if every other ...
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 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 fraction is a fraction with numerator 1. Examples of unit fractions include 1/2, 1/3, 1/12, and 1/123456. The famous Rhind papyrus, dated to around 1650 BC, discusses ...
A distance graph with distance set (0,1].
A unit ring is a ring with a multiplicative identity. It is therefore sometimes also known as a "ring with identity." It is given by a set together with two binary operators ...
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 ...
The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...
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 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 ...
...
View search results from all Wolfram sites (28442 matches)

