Consimilarity of Commutative Quaternion Matrices
نویسندگان
چکیده
منابع مشابه
A brief introduction to quaternion matrices and linear algebra and on bounded groups of quaternion matrices
The division algebra of real quaternions, as the only noncommutative normed division real algebra up to isomorphism of normed algebras, is of great importance. In this note, first we present a brief introduction to quaternion matrices and quaternion linear algebra. This, among other things, will help us present the counterpart of a theorem of Herman Auerbach in the setting of quaternions. More ...
متن کاملInverse Young inequality in quaternion matrices
Inverse Young inequality asserts that if $nu >1$, then $|zw|ge nu|z|^{frac{1}{nu}}+(1-nu)|w|^{frac{1}{1-nu}}$, for all complex numbers $z$ and $w$, and equality holds if and only if $|z|^{frac{1}{nu}}=|w|^{frac{1}{1-nu}}$. In this paper the complex representation of quaternion matrices is applied to establish the inverse Young inequality for matrices of quaternions. Moreover, a necessary and ...
متن کاملQuo Vadis Quaternion? Cryptanalysis of Rainbow over Non-commutative Rings
The Rainbow Signature Scheme is a non-trivial generalization of the well known Unbalanced Oil and Vinegar Signature Scheme (Eurocrypt '99) minimizing the length of the signatures. Recently a new variant based on non-commutative rings, called NC-Rainbow, was introduced at CT-RSA 2012 to further minimize the secret key size. We disprove the claim that NC-Rainbow is as secure as Rainbow in general...
متن کاملA Non-commutative Cryptosystem Based on Quaternion Algebras
We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring. The multiplication operation in our cryptosystem can be performed with high speed using quaternions algebras over finite rings. As a consequence, the key generation and encryption process of our cryptosystem is faster than NTRU in comparable pa...
متن کاملLengths of quasi-commutative pairs of matrices
In this paper we discuss some partial solutions of the length conjecture which describes the length of a generating system for matrix algebras. We consider mainly the algebras generated by two matrices which are quasi-commuting. It is shown that in this case the length function is linearly bounded. We also analyze which particular natural numbers can be realized as the lengths of certain specia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Miskolc Mathematical Notes
سال: 2015
ISSN: 1787-2405,1787-2413
DOI: 10.18514/mmn.2015.1421