R matrix for generalized quantum group of type A

نویسندگان

چکیده

The generalized quantum group U(ϵ) of type A is an affine analogue associated to a general linear Lie superalgebra glM|N. We prove that there exists unique R matrix on the tensor product fundamental representations for arbitrary parameter sequence ϵ corresponding non-conjugate Borel subalgebra give explicit description its spectral decomposition, and then as application, construct family finite-dimensional irreducible U(ϵ)-modules which have subspaces isomorphic Kirillov-Reshetikhin modules usual AM−1(1) or AN−1(1).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Orbits of R-matrix Type

Given a simple Lie algebra g, we consider the orbits in g * which are of R-matrix type, i.e., which possess a Poisson pencil generated by the Kirillov-Kostant-Souriau bracket and the so-called R-matrix bracket. We call an algebra quantizing the latter bracket a quantum orbit of R-matrix type. We describe some orbits of this type explicitly and we construct a quantization of the whole Poisson pe...

متن کامل

a cauchy-schwarz type inequality for fuzzy integrals

نامساوی کوشی-شوارتز در حالت کلاسیک در فضای اندازه فازی برقرار نمی باشد اما با اعمال شرط هایی در مسئله مانند یکنوا بودن توابع و قرار گرفتن در بازه صفر ویک می توان دو نوع نامساوی کوشی-شوارتز را در فضای اندازه فازی اثبات نمود.

15 صفحه اول

Matrix Quantum Groups of Type

To a Hecke symmetry R there associate the matrix bialgebra ER and the matrix Hopf algebra HR, which are called function rings on the matrix quantum semi-group and matrix quantum groups associated to R. We show that for an even Hecke symmetry, the rational representations of the corresponding quantum group are absolutely reducible and compute the integral on the function ring of the quantum grou...

متن کامل

A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation

Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2021

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2020.09.009