Pith. sign in

xPerm: fast index canonicalization for tensor computer algebra

9 Pith papers cite this work. Polarity classification is still indexing.

9 Pith papers citing it
abstract

We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subroutine. The latter performs the most demanding parts of the computations and can be linked from any other program or computer algebra system. We demonstrate with tests and timings the effectively polynomial performance of the Butler-Portugal algorithm with respect to the number of indices, though we also show a case in which it is exponential. Our implementation handles generic tensorial expressions with several dozen indices in hundredths of a second, or one hundred indices in a few seconds, clearly outperforming all other current canonicalizers. The code has been already under intensive testing for several years and has been essential in recent investigations in large-scale tensor computer algebra.

citation-role summary

method 2 background 1

citation-polarity summary

years

2026 7 2025 2

representative citing papers

Spectral Functions of Lorentzian Quantum Gravity

hep-th · 2026-06-17 · unverdicted · novelty 6.0

Spectral functions for graviton and scalar graviton modes are derived in Lorentzian asymptotically safe quantum gravity via adapted FRG flow equations, yielding normalisable results consistent with infrared effective theory.

citing papers explorer

Showing 9 of 9 citing papers.