An algorithm to simplify tensor expressions (Q1807987)

The present paper designs an algorithm for simplifying tensor expressions. One knows that the tensor symmetry and presence of dummy indices make the problem complex. In the first part of this work, the tensor expressions are put into a canonical form taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The definition of the canonical form involves some conventions, which are based on the simplicity of the implementation and on a readable display for tensor expressions. In the second part of this work, the Gröbner basis method is used to address the linear identities coming from cyclic symmetries or more general tensor identities. Some timing of an experimental implementation of the algorithm over the Riemann package are presented.