Ideal decompositions and computation of tensor normal forms

Simple item page
dc.creatorFiedler, B.
dc.date2002-11-09
dc.date.accessioned2026-07-07T04:52:48Z
dc.date.available2026-07-07T04:52:48Z
dc.descriptionSymmetry 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/math/0211156
dc.identifierhttp://arxiv.org/abs/math/0211156
dc.identifierSeminaire Lotharingien de Combinatoire, 45 (2001) Article B45g. http://www.mat.univie.ac.at/~slc/wpapers/s45fiedler.html
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65606
dc.subjectCombinatorics
dc.subjectSymbolic Computation
dc.subjectDifferential Geometry
dc.subject16D60; 15A72; 05E10; 16D70; 16S50; 05-04
dc.titleIdeal decompositions and computation of tensor normal forms
dc.typetext

Files

Collections

arXiv