Pith. sign in

REVIEW 1 cited by

Hiding canonicalisation in tensor computer algebra

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.11946 v1 pith:3IUGK6CE submitted 2022-08-25 cs.SC gr-qchep-th

classification cs.SCgr-qchep-th
keywords expressionsalgebracomputertensorcanonicalisationformsalternativecadabra
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Using SimTeEx to simplify polynomial expressions with tensors

    hep-ph 2024-12 conditional novelty 6.0 of 10

    SimTeEx simplifies tensor polynomials with arbitrary symmetry relations by combining graph-based handling of dummy indices with reduced row echelon form linear algebra.

Pith tools