Ideal decompositions and computation of tensor normal forms

Details Ideal decompositions and computation of tensor normal forms Ideal decompositions and computation of tensor normal forms

2002-11-09

arxiv.org/abs/math/0211156v1

Seminaire Lotharingien de Combinatoire, 45 (2001) Article B45g. http://www.mat.univie.ac.at/~slc/wpapers/s45fiedler.html

Mathematics

Combinatorics

16 pages

Scientific paper

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace W^{\bot} of W within the dual space of K[S_r] yield linear identities needed for a treatment of the term combination problem for the coordinates of the T. We give the structure of these W for every situation which appears in symbolic tensor calculations by computer. Characterizing idempotents of such W can be determined by means of an ideal decomposition algorithm which works in every semisimple ring up to an isomorphism. Furthermore, we use tools such as the Littlewood-Richardson rule, plethysms and discrete Fourier transforms for S_r to increase the efficience of calculations. All described methods were implemented in a Mathematica package called PERMS.

Affiliated with

Also associated with

No associations

Rating

Ideal decompositions and computation of tensor normal forms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ideal decompositions and computation of tensor normal forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ideal decompositions and computation of tensor normal forms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247600