Combinatorial aspects of simplification of algebraic expressions

  • A.Ya. Rodionov
  • A.Yu. Taranov
Applications And Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)


A possible way of developing computer algebra systems is an "education" of the system. By "education" we mean here supplying the system with the capacity for handling new classes of mathematical objects. Tensors or, more generally, functions of several variables are an examples of such objects of practical interest. The main features of these objects which makes nontrivial the problem of incorporating them into a computer algebra system, are the symmetry properties exhibited by tensors (functions) we meet in practice. The simplification of expressions containg tensor monomials involves two operations: monomial identification and monomial pattern matching. The tensor identification problem when dummy summation indices are included and the tensor pattern matching problem when the pattern has free variables may both be reformulated as combinatorial problems. The first one is reducible to the double coset problem for the permutation group and the second, to a variant of the general combinatorial object isomorphism problem. The backtrack algorithms for solving the above two problems are based on some well-known ideas in computational group theory. A recursive variant of the tensor identification algorithm for a restricted class of symmetry groups and the algorithm implementation are discussed briefly.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bogen R.A., Pavelle R. Lett.Math.Phys. 1977, 2, p.55.CrossRefGoogle Scholar
  2. 2.
    Bogen R.A., Journ.Symb. Computations, 1985, 1.Google Scholar
  3. 3.
    De-Witt B.S. Dynamical theory of Groups and Fields. Gordon Breach, 1965.Google Scholar
  4. 4.
    Barvinsky A.O., Vilkovysky G.A. Phys.Rep., 1985, v.119, 1–74.CrossRefGoogle Scholar
  5. 5.
    Rodionov A.Ya., Taranov A.Yu. Preprint IHEP 86–86, Serputkhov, 1986.Google Scholar
  6. 6.
    Sing J.L. Relativity the General Theory, North-Holland, Amstersdam, 1960.Google Scholar
  7. 7.
    Bateman H., Erdelyi A. Higher transcendental functions. v.1, McGRAW-HILL 1953.Google Scholar
  8. 8.
    Hall M. Theory of groups. Macmillan, New York, 1959.Google Scholar
  9. 9.
    Leon G.S. in Computational group theory. Academic Press, London, 1984, p.321.Google Scholar
  10. 10.
    Butler G., Lam C.W.H. J. of Symbolic Computations. 1985, 1, p.363.Google Scholar
  11. 11.
    Sims I.C. in Computational problems in abstract algebra. Pergamon Press, 1970, p.169.Google Scholar
  12. 12.
    Hoffman C.M. Group Theoretic algorithms and Graph Isomorphism Lect. Notes in Computer Science, No.136.Google Scholar
  13. 13.
    Hearn A.C. REDUCE-2 User 's Manual, UCP 19. 1973, Univ. of Utah, USA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • A.Ya. Rodionov
    • 1
  • A.Yu. Taranov
    • 1
  1. 1.Institute of Nuclear PhysicsMoccow State UniversityMoscowUSSR

Personalised recommendations