A path-matrix algorithm yields irreducible Cartesian tensor decomposition matrices up to rank 9 and orthogonal bases of equivariant spaces, surpassing prior rank-5 and spanning-set limits.
E(3)-equivariant graph neural networks for data-efficient and accurate interatomic potentials
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces
A path-matrix algorithm yields irreducible Cartesian tensor decomposition matrices up to rank 9 and orthogonal bases of equivariant spaces, surpassing prior rank-5 and spanning-set limits.