A new family of polynomial identities for computing determinants
Georgy Egorychev

TL;DR
This paper introduces a new family of polynomial identities for computing determinants across various algebraic structures, including commutative, noncommutative, and nonassociative rings, and explores their properties.
Contribution
It presents novel definitions of determinants for diverse algebraic rings and investigates their fundamental properties, expanding the theoretical framework of determinant computation.
Findings
New determinant definitions for multiple algebraic structures
Properties of these determinants are systematically studied
Potential applications in algebra and computational mathematics
Abstract
We give new definitions for the determinant over commutative ring , noncommutative ring , noncommutative ring with associative powers, over noncommutative nonassociative ring , and study their properties.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation · Advanced Topics in Algebra
