All Samples(2) | Call(0) | Derive(0) | Import(2)

A permutation, alternatively known as an 'arrangement number' or 'ordering' is an arrangement of the elements of an ordered list into a one-to-one mapping with itself. The permutation of a given arrangement is given by indicating the positions of the elements after re-arrangment [2]_. For example, if one started with elements [x, y, a, b] (in that order) and they were reordered as [x, y, b, a] then the permutation would be [0, 1, 3, 2]. Notice that (in SymPy) the first element is always referred to as 0 and the permutation uses the indices of the elements in the original ordering, not the elements (a, b, etc...) themselves. (more...)

src/s/y/sympy-HEAD/sympy/combinatorics/tests/test_tensor_can.py

**sympy**(Download)

from sympy.combinatorics.perm_groups import PermutationGroup from sympy.combinatorics.permutations import Permutation, Perm from sympy.combinatorics.tensor_can import (perm_af_direct_product, dummy_sgs, riemann_bsgs, get_symmetric_group_sgs, gens_products, canonicalize, bsgs_direct_product)

src/s/y/sympy-0.7.5/sympy/combinatorics/tests/test_tensor_can.py

**sympy**(Download)

from sympy.combinatorics.perm_groups import PermutationGroup from sympy.combinatorics.permutations import Permutation, Perm from sympy.combinatorics.tensor_can import (perm_af_direct_product, dummy_sgs, riemann_bsgs, get_symmetric_group_sgs, gens_products, canonicalize, bsgs_direct_product)