The Standard Quantized Matrix Algebra is A Solvable Polynomial Algebra
arXiv:2202.11442
Abstract
Let be the standard quantized matrix algebra, introduced by Faddeev, Reshetikhin, and Takhtajan. It is shown, by constructing an appropriate monomial ordering on its PBW -basis , that is a solvable polynomial algebra. Consequently, further structural properties of and their modules may be established and realized in a constructive-computational way.
8 pages. arXiv admin note: text overlap with arXiv:2112.13628