Hiding canonicalisation in tensor computer algebra

Price, Dominic; Peeters, Kasper; Zamaklar, Marija

Abstract

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.

Citation

Price, D., Peeters, K., & Zamaklar, M. Hiding canonicalisation in tensor computer algebra

• Working Paper Type: Working Paper
• Publication Date: Aug 25, 2022
• Deposit Date: Nov 10, 2023
• Publicly Available Date: Nov 14, 2023
• DOI: https://doi.org/10.48550/arXiv.2208.11946
• Public URL: https://durham-repository.worktribe.com/output/1907439
• Publisher URL: https://doi.org/10.48550/arXiv.2208.11946