How to construct a upper triangular matrix that satisfy the quadratic polynomial equation with different roots
Ivan Gargate, Michael Gargate

TL;DR
This paper characterizes all upper triangular matrices over a ring that satisfy a specific quadratic polynomial with distinct roots, providing explicit descriptions and counting solutions in finite rings.
Contribution
It offers a complete description of matrices satisfying quadratic equations with distinct roots over rings, including counting solutions in finite rings.
Findings
Explicit characterization of matrices satisfying quadratic equations over rings.
Counting solutions in finite rings for the matrix quadratic equation.
Extension to infinite upper triangular matrices.
Abstract
Let be an associative ring with identity . We describe all matrices in the ring of upper triangular matrices over (), and the ring of infinite upper triangular matrices over , satisfying the quadratic polynomial equation . For such propose we assume that the above polynomial have two different roots in . Moreover, in the case that in finite, we compute the number of all matrices to solves the matrix equation where is the identity matrix.
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 Topics in Algebra · Matrix Theory and Algorithms · Polynomial and algebraic computation
