Combinatorial aspects of simplification of algebraic expressions

DOI10.1007/3-540-51517-8_113zbMATH Open1209.68694OpenAlexW1482693440MaRDI QIDQ5393333FDOQ5393333

Authors: A. Ya. Rodionov, A. Yu. Taranov 

Publication date: 16 April 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51517-8_113

Recommendations

• An algorithm to simplify tensor expressions
• Riemann tensor polynomial canonicalization by graph algebra extension
• scientific article; zbMATH DE number 1273666
• GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
• Algorithmic simplification of tensor expressions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Symbolic computation and algebraic computation (68W30)

Cited In (6)

• The method of colored graphs for simplifying expressions with indices
• Tensor computations in computer algebra systems
• Canonical representation of polynomial expressions with indices
• GROUP-THEORETIC APPROACH FOR SYMBOLIC TENSOR MANIPULATION
• Title not available (Why is that?)
• xPerm: fast index canonicalization for tensor computer algebra

This page was built for publication: Combinatorial aspects of simplification of algebraic expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393333)