The Standard Quantized Matrix Algebra Mq(n) is A Solvable Polynomial Algebra

Abstract

Let Mq(n) be the standard quantized matrix algebra, introduced by Faddeev, Reshetikhin, and Takhtajan. It is shown, by constructing an appropriate monomial ordering on its PBW K-basis B , that Mq(n) is a solvable polynomial algebra. Consequently, further structural properties of Mq(n) and their modules may be established and realized in a constructive-computational way.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…