Diagonal reduction algebras of gl type
classification
🧮 math.RT
keywords
algebrasreductiondiagonalrelationsalgebraalgorithmiccompleteconcerning
read the original abstract
Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra $gl_n$ into $gl_n \oplus gl_n$, we establish a stabilization phenomenon and list the complete sets of defining relations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.