Combinatorial aspects of simplification of algebraic expressions

@inproceedings{Rodionov1987CombinatorialAO,
  title={Combinatorial aspects of simplification of algebraic expressions},
  author={A. Rodionov and A. Taranov},
  booktitle={EUROCAL},
  year={1987}
}
  • A. Rodionov, A. Taranov
  • Published in EUROCAL 1987
  • Mathematics, Computer Science
  • 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… CONTINUE READING
    13 Citations
    Simplification of tensor expressions in computer algebra
    Canonical Representation of Polynomial Expressions with Indices
    Independent Components of an Indexed Object with Linear Symmetries
    • PDF
    Symbolic Computation with Indexed Objects within MATHEMATICA
    Symbolic Computations with Indexed Objects within
    • MathematicaSergei A. KlionerLohrmann
    • 1998
    Computer algebra in gravity research
    • M. MacCallum
    • Physics, Medicine
    • Living reviews in relativity
    • 2018
    • 10
    • PDF

    References

    SHOWING 1-9 OF 9 REFERENCES
    A General Backtrack Algorithm for the Isomorphism Problem of Combinatorial Objects
    • 38
    Indicial tensor manipulation on macsyma
    • 5
    Group-Theoretic Algorithms and Graph Isomorphism
    • C. Hoffmann
    • Mathematics, Computer Science
    • Lecture Notes in Computer Science
    • 1982
    • 231
    • PDF
    Higher Transcendental Functions
    • 4,072
    Relativity: The General Theory
    • 1,982
    Computational Problems in Abstract Algebra
    • 524
    • PDF
    Dynamical theory of groups and fields
    • 1,552