Search Results for ""

In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...

Every finite group of order n can be represented as a permutation group on n letters, as first proved by Cayley in 1878 (Rotman 1995).

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

Let A, B, and C be three polar vectors, and define V_(ijk) = |A_i B_i C_i; A_j B_j C_j; A_k B_k C_k| (1) = det[A B C], (2) where det is the determinant. The V_(ijk) is a ...

The number of elements greater than i to the left of i in a permutation gives the ith element of the inversion vector (Skiena 1990, p. 27).

A primitive subgroup of the symmetric group S_n is equal to either the alternating group A_n or S_n whenever it contains at least one permutation which is a q-cycle for some ...

Let G be a group and theta n permutation of G. Then theta is an orthomorphism of G if the self-mapping nu of G defined by nu(x)=x^(-1)theta(x) is also an permutation of G.

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

A correspondence between a permutation and a pair of Young tableaux.

The structure constant is defined as iepsilon_(ijk), where epsilon_(ijk) is the permutation symbol. The structure constant forms the starting point for the development of Lie ...