Hiding canonicalisation in tensor computer algebra

08/25/2022
by   Dominic Price, et al.
0

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 FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2018

Simplification of tensor expressions in computer algebra

Computer algebra is widely used in various fields of mathematics, physic...
research
01/30/2017

Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension

Tensor expression simplification is an "ancient" topic in computer algeb...
research
06/22/2020

Computer Algebra in Physics: The hidden SO(4) symmetry of the hydrogen atom

Pauli first noticed the hidden SO(4) symmetry for the Hydrogen atom in t...
research
01/05/2020

On Stability of Tensor Networks and Canonical Forms

Tensor networks such as matrix product states (MPS) and projected entang...
research
11/10/2021

NRPyLaTeX: A LaTeX interface to computer algebra systems for general relativity

While each computer algebra system (CAS) contains its own unique syntax ...
research
08/08/2020

dxo: A System for Relational Algebra and Differentiation

We present dxo, a relational system for algebra and differentiation, wri...
research
06/18/2020

Extraction and Evaluation of Formulaic Expressions Used in Scholarly Papers

Formulaic expressions, such as 'in this paper we propose', are helpful f...

Please sign up or login with your details

Forgot password? Click here to reset