Recognition: unknown
nth Roots of nth Powers
classification
🧮 math.GM
keywords
matricesactionapplicationcanonicalizingcircuitouslydoubleefficientequation
read the original abstract
Seeking simple, efficient solutions of a matrix equation leads (quite circuitously) to optimizing unimodular zerofree matrices. Canonicalizing such matrices under signed-permutation double action offers an ideal application of GPUs (graphics processing units).
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Small Matrices with Small Inverses: Unimodular Zerofree Cases
Unimodular zero-free matrices with small entries in both M and M^{-1} are classified up to symmetry.
-
Small Matrices with Small Inverses: Unimodular Zerofree Cases
Rare unimodular zerofree matrices exist where both M and M inverse remain small and can be classified up to symmetry.
-
Small Matrices with Small Inverses: Unimodular Zerofree Cases
Rare unimodular zerofree matrices with small inverses that are also zerofree are classified up to symmetry.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.