Mar 6, 2008 · We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been …

Oct 15, 2008 · We present a very fast implementation of the Butler–Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been …

xPerm extends Mathematica capabilities in computations with large groups of permutations, focusing on the problem of index canonicalization under permutation symmetries of tensor …

ex canonicalization with respect to permutation symmetries. It is called xPerm, and has been written a. a combination of a Mathematica package and a C subroutine. The latter performs …

We present a very fast implementation of the Butler鳳ortugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a …

Oct 15, 2008 · Abstract We present a very fast implementation of the Butler–Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has …

Mar 6, 2008 · We present a very fast implementation of the Butler–Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been …

We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a …

Oct 1, 2008 · We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been …

xPerm‘ extends Mathematica capabilities in computations with large groups of permutations. This package can be used independently, but it has been created as a tool for its twin package …