The Method of Colored Graphs for Simplifying Expressions with Indices


Computer algebra is increasingly used in research and applied computations. An example is tensor computations or, in a wide sense, simplification of expressions containing indices. In this paper, the method of colored graphs designed for simplifying abstract expressions containing indices is developed for the case when the indices are of different types. An example of such indices are upper and lower indices in tensor expressions. The proposed approach significantly reduces the number of combinations to be considered when the canonical form of the expression is sought; as a result, the computations are drastically accelerated.

This is a preview of subscription content, access via your institution.


  1. 1

    Shpiz, G. and Kryukov, A., Canonical representation of polynomial expressions with indices, Program. Comput. Software, 2019, vol. 45, no. 2, pp. 81–87.

    MathSciNet  Article  Google Scholar 

  2. 2

    Korol’kova, A.V., Kulyabov, D.S., and Sevast’yanov, L.A., Tensor computations in computer algebra systems, Program. Comput. Software, 2013, vol. 39, no. 3, pp. 135–142.

    MathSciNet  Article  Google Scholar 

  3. 3

    MacCallum, M.A.H., Computer algebra in gravity research, Living Reviews in Relativity, 2018, vol. 21, p. 6.

    Article  Google Scholar 

  4. 4

    Li, H., Li, Zh., and Li, Y., Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension, Proc. of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017, pp. 1269–276.

  5. 5

    Portugal, R., An algorithm to simplify tensor expressions, Comput. Phys. Commun., 1998, vol. 115, pp. 215–230.

    MathSciNet  Article  Google Scholar 

  6. 6

    Steinwachs, Ch.F., Combinatorial aspects in the one-loop renormalization of higher derivative theories, ArXiv: 1909:00810, 2019.

  7. 7

    Rodionov, A.Y. and Taranov, A.Y., Combinatorial aspects of simplification of algebraic expressions, Proc. Int. Conf. EUROCAL’89, Lect. Notes Comput. Sci., 1989, vol. 378, pp. 192–201.

  8. 8

    Ilyin, V.A. and Kryukov, A.P., ATENSOR – REDUCE program for tensor simplification, Comput. Phys. Commun., 1996, vol. 96, pp. 36–52.

    Article  Google Scholar 

  9. 9


  10. 10

    Hearn, A.C. and Schöpf, R., REDUCE User’s Manual, Free Version.

  11. 11

    Abramov, S.A. and Bogolyubskaya, A.A., The research seminar on computer algebra in 2016–2017, Programmirovanie, 2018, no. 2, pp. 3–4.

Download references


We are grateful to V. A. Ilyin for fruitful discussions and to S.A. Abramov for stimulating this research and the opportunity to make a report in the seminar on computer algebra [11].


This work was done within the state project no. 115041410196.

Author information



Corresponding authors

Correspondence to G. B. Shpiz or A.P. Kryukov.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Shpiz, G.B., Kryukov, A. The Method of Colored Graphs for Simplifying Expressions with Indices. Program Comput Soft 47, 25–28 (2021).

Download citation