Wedderburn polynomials over division rings, II
T.Y.Lam (University of California, Berkeley), A. Leroy (Universit\'e, d'Artois, France), A. Ozturk (University of Mons, Belgium)

TL;DR
This paper extends the study of Wedderburn polynomials over division rings, exploring their applications in matrix triangulation, diagonalization, eigenvalues, and generalizing Wedderburn's theorem through $G$-algebraic sets.
Contribution
It introduces new applications of Wedderburn polynomials to matrix theory and generalizes Wedderburn's theorem using $G$-algebraic sets in division rings.
Findings
Characterization of Wedderburn polynomials in the context of $(S,D)$-pseudo-linear transformations
Applications to matrix triangulation, diagonalization, and eigenvalues over division rings
Introduction of $G$-algebraic sets and their role in polynomial factorization
Abstract
A polynomial in an Ore extension over a division ring is a Wedderburn polynomial if is monic and is the minimal polynomial of an algebraic subset of . These polynomials have been studied in "Wedderburn polynomials over division rings,I (Journal of Pure and Applied Algebra, Vol. 186, (2004), 43-76). In this paper, we continue this study and give some applications to triangulation, diagonalization and eigenvalues of matrices over a division ring in the general setting of -pseudo-linear transformations. In the last section we introduce and study the notion of -algebraic sets which, in particular, permits generalization of Wedderburn's theorem relative to factorization of central polynomials.
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
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · graph theory and CDMA systems
