Hiding canonicalisation in tensor computer algebra

Price, Dominic, Kasper Peeters, Marija Zamaklar · arXiv (Cornell University) · 2022

Simplification of expressions in computer algebra systems often involves a step known as "canonicalisation", which reduces equivalent expressions to the same form. However, such forms may not be natural from the perspective of a pen-and-paper computation, or may be unwieldy, or both. This is, for example, the case for expressions involving tensor multi-term symmetries. We propose an alternative strategy to handle such tensor expressions, which hides canonical forms from the user entirely, and present an implementation of this idea in the Cadabra computer algebra system.

Read the paper · More papers on PaperTik