On a representation of commuting maps by tensor products

A remark on asymptotic enumeration of highest weights in tensor powers of a representation

We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...

a study on insurer solvency by panel data model: the case of iranian insurance market

the aim of this thesis is an approach for assessing insurer’s solvency for iranian insurance companies. we use of economic data with both time series and cross-sectional variation, thus by using the panel data model will survey the insurer solvency.

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...

Linear Maps Preserving Numerical Radius of Tensor Products of Matrices

Let m,n ≥ 2 be positive integers. Denote by Mm the set of m×m complex matrices and by w(X) the numerical radius of a square matrix X. Motivated by the study of operations on bipartite systems of quantum states, we show that a linear map φ : Mmn →Mmn satisfies w(φ(A⊗B)) = w(A⊗B) for all A ∈Mm and B ∈Mn if and only if there is a unitary matrix U ∈Mmn and a complex unit ξ such that φ(A⊗B) = ξU(φ1(...

Commuting maps on rank-k matrices