Search Results for ""

The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...

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

The statistics h_(r,s,...) defined such that <h_(r,s,...)>=mu_rmu_s..., where mu_r is a central moment. These statistics generalize h-statistics and were originally called ...

A map defined by one or more polynomials. Given a field K, a polynomial map is a map f:K^n->K^m such that for all points (x_1,...,x_n) in K^n, ...

The principal value of an analytic multivalued function is the single value chosen by convention to be returned for a given argument. Complex multivalued functions have ...

The term "product" refers to the result of one or more multiplications. For example, the mathematical statement a×b=c would be read "a times b equals c," where a is called ...

A mathematical problem, usually not requiring advanced mathematics, to which a solution is desired. Puzzles frequently require the rearrangement of existing pieces (e.g., 15 ...

The quaternion group is one of the two non-Abelian groups of the five total finite groups of order 8. It is formed by the quaternions +/-1, +/-i, +/-j, and +/-k , denoted Q_8 ...

The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...