The DOI matches its Crossref record.
xPerm: fast index canonicalization for tensor computer algebra
Open accessAbstract
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. Program summary Program title: xPerm Catalogue identifier: AEBH_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEBH_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 93 582 No. of bytes in distributed program, including test data, etc.: 1 537 832 Distribution format: tar.gz Programming language: C and Mathematica (version 5.0 or higher) Computer: Any computer running C and Mathematica (version 5.0 or higher) Operating system: Linux, Unix, Windows XP, MacOS RAM:: 20 Mbyte Word size: 64 or 32 bits Classification: 1.5, 5 Nature of problem: Canonicalization of indexed expressions with respect to permutation symmetries. Solution method: The Butler–Portugal algorithm. Restrictions: Multiterm symmetries are not considered. Running time: A few seconds with generic expressions of up to 100 indices. The xPermDoc.nb notebook supplied with the distribution takes approximately one and a half hours to execute in full.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Deffayet, C., Esposito-Farèse, G., & Vikman, A. (2009) · Physical Review D · doi:10.1103/physrevd.79.084003 · Cited by 1,066
Maximal freedom at minimum cost: linear large-scale structure in general modifications of gravity
Bellini, E., & Sawicki, I. (2014) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2014/07/050 · Cited by 421
xTras: A field-theory inspired xAct package for mathematica
Nutma, T. (2014) · Computer Physics Communications · doi:10.1016/j.cpc.2014.02.006 · Cited by 254
Lorentzian Quantum Gravity and the Graviton Spectral Function
Fehre, J., Litim, D. F., Pawlowski, J. M., & Reichert, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.081501 · Cited by 82
The derivative expansion in asymptotically safe quantum gravity: general setup and quartic order
Knorr, B. (2021) · SciPost Physics Core · doi:10.21468/scipostphyscore.4.3.020 · Cited by 49
Metadata
- Authors
- Martín-García, J. M.
- Venue
- Computer Physics Communications
- Publisher
- Elsevier BV
- Published
- 2008-10
- Volume
- 179
- Issue
- 8
- Pages
- 597-603
- ISSN
- 0010-4655 (ISSN-L)
- OpenAlex
- W1979058129
- Cited by
- 214
- References
- 0
- FWCI
- 10.89
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: xPerm: fast index canonicalization for tensor computer algebra. https://app.cochat.ai/papers/10.1016/j.cpc.2008.05.009
- The paper
- Martín-García, J. M. (2008). xPerm: fast index canonicalization for tensor computer algebra. Computer Physics Communications. https://doi.org/10.1016/j.cpc.2008.05.009
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.