The method of colored graphs for simplifying expressions with indices

DOI10.1134/S0361768821010102zbMath1480.05061OpenAlexW3132249325MaRDI QIDQ2027842

A. P. Kryukov, G. B. Shpiz

Publication date: 28 May 2021

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768821010102

zbMATH Keywords

automorphismscanonical form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Algorithms for checking some properties of \(n\)-quasigroups

Uses Software

• ATENSOR
• REDUCE
• Riegeom

Cites Work

• Tensor computations in computer algebra systems
• ATENSOR -- REDUCE program for tensor simplification
• An algorithm to simplify tensor expressions
• Canonical representation of polynomial expressions with indices
• Riemann Tensor Polynomial Canonicalization by Graph Algebra Extension
• Combinatorial aspects of simplification of algebraic expressions

This page was built for publication: The method of colored graphs for simplifying expressions with indices