scholarly journals Cayley–Hamilton theorem for symplectic quantum matrix algebras

Author(s):  
Oleg Ogievetsky ◽  
Pavel Pyatov
1999 ◽  
Vol 40 (1) ◽  
pp. 427-448 ◽  
Author(s):  
L. K. Hadjiivanov ◽  
A. P. Isaev ◽  
O. V. Ogievetsky ◽  
P. N. Pyatov ◽  
I. T. Todorov

1999 ◽  
Vol 27 (2) ◽  
pp. 493-510
Author(s):  
Hans Plesner Jakobsen ◽  
Hechun Zhang

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Dimitri Gurevich ◽  
Pavel Saponov ◽  
Dmitry Talalaev

Abstract The notion of compatible braidings was introduced in Isaev et al. (1999, J. Phys. A, 32, L115–L121). On the base of this notion, the authors of Isaev et al. (1999, J. Phys. A, 32, L115–L121) defined certain quantum matrix algebras generalizing the RTT algebras and Reflection Equation ones. They also defined analogues of some symmetric polynomials in these algebras and showed that these polynomials generate commutative subalgebras, called Bethe. By using a similar approach, we introduce certain new algebras called generalized Yangians and define analogues of some symmetric polynomials in these algebras. We claim that they commute with each other and thus generate a commutative Bethe subalgebra in each generalized Yangian. Besides, we define some analogues (also arising from couples of compatible braidings) of the Knizhnik–Zamolodchikov equation—classical and quantum. Communicated by: Alexander Veselov


1999 ◽  
Vol 32 (9) ◽  
pp. L115-L121 ◽  
Author(s):  
A Isaev ◽  
O Ogievetsky ◽  
P Pyatov

2020 ◽  
Vol 25 (4) ◽  
pp. 4-9
Author(s):  
Yerzhan R. Baissalov ◽  
Ulan Dauyl

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.


Sign in / Sign up

Export Citation Format

Share Document