We upgraded Indico to version 3.0. The new search is now available as well.
10-15 March 2019
Steinmatte conference center
Europe/Zurich timezone

Computer algebra algorithm of simplification of tensor polynomials

Not scheduled
Steinmatte conference center

Steinmatte conference center

Hotel Allalin, Saas Fee, Switzerland https://allalin.ch/conference/
Oral Track 3: Computations in Theoretical Physics: Techniques and Methods Track 3: Computations in Theoretical Physics: Techniques and Methods


Dr Alexander Kryukov (SINP MSU)


Tensor calculations are an important case in many natural sciences like mathematics and physics. To simplify such expressions, computer algebra is widely used. There are a number of approaches for solving this problem, namely, the component calculations, the calculations when tensor is considered as an abstract symbol with indices possessing some symmetry properties, and finally a pure abstract calculus like exterior algebra. In this paper we describe a method for reducing tensor expressions to the canonical form using group algebra method. The focus is on taking into account symmetry properties with respect to various permutations of indices inside the tensor, symmetries associated with renaming summation indices, as well as linear relationships between tensors, such as Bianchi identities. We define the canonical representation for polynomial (multiplicative) tensor expressions, which is the result of averaging the tensor expression over the orbits of certain finite group (stabilizer). We present a sketch of the algorithm which reduces tensor expression to the canonical form. The approach is illustrated by examples containing Riemann curvature tensors.

Primary author

Dr Alexander Kryukov (SINP MSU)


Dr Grigory Shpiz (SINP MSU)

Presentation materials

There are no materials yet.