2009/12/20 by S. Khoroshkin, Khoroshkin, Sergey, O. Ogievetsky +1 · 3 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topics in Algebra #Rough Sets and Fuzzy Logic
paper · doi:10.48550/arxiv.0912.4055
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 gln into gln ⊕ gln, we establish a stabilization phenomenon and list the complete sets of defining relations.