Search Results for ""

Let K be a number field and let O be an order in K. Then the set of equivalence classes of invertible fractional ideals of O forms a multiplicative Abelian group called the ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A power mean is a mean of the form M_p(a_1,a_2,...,a_n)=(1/nsum_(k=1)^na_k^p)^(1/p), (1) where the parameter p is an affinely extended real number and all a_k>=0. A power ...

The Pythagorean means are the three "classic" means A (the arithmetic mean), G (the geometric mean), and H (the harmonic mean) are sometimes known as the Pythagorean means. ...

A qubit (or quantum bit) is the analog of a bit for quantum computation. Unlike an ordinary bit, which may only assume two possible values (usually called 0 and 1), a qubit ...

The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

Given a ring R with identity, the special linear group SL_n(R) is the group of n×n matrices with elements in R and determinant 1. The special linear group SL_n(q), where q is ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

A particle P is said to be undergoing uniform circular motion if its radius vector in appropriate coordinates has the form (x(t),y(t),0), where x(t) = Rcos(omegat) (1) y(t) = ...