TOPICS
Search

Search Results for ""


2701 - 2710 of 13134 for complexity theorySearch Results
A quantity x>0, which may be written with an explicit plus sign for emphasis, +x.
A sequence {mu_n}_(n=0)^infty is positive definite if the moment of every nonnegative polynomial which is not identically zero is greater than zero (Widder 1941, p. 132). ...
A positive integer n is kth powerfree if there is no number d such that d^k|n (d^k divides n), i.e., there are no kth powers or higher in the prime factorization of n. A ...
Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...
A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...
Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.
A primary ideal is an ideal I such that if ab in I, then either a in I or b^m in I for some m>0. Prime ideals are always primary. A primary decomposition expresses any ideal ...
Let pi be a unitary representation of a group G on a separable Hilbert space, and let R(pi) be the smallest weakly closed algebra of bounded linear operators containing all ...
An irreducible algebraic integer which has the property that, if it divides the product of two algebraic integers, then it divides at least one of the factors. 1 and -1 are ...
When the group order h of a finite group is a prime number, there is only one possible group of group order h. Furthermore, the group is cyclic.
1 ... 268|269|270|271|272|273|274 ... 1314 Previous Next

...