منابع مشابه
Criteria for existence of semigroup homomorphisms and projective rank functions
Suppose A, S, and T are semigroups, e: A → S and f : A → T semigroup homomorphisms, and X a generating set for S. We assume (1) that every element of S divides some element of e(A), (2) that T is cancellative, (3) that T is power-cancellative (i.e, xd = yd ⇒ x = y for d > 0), and (4) a further technical condition, which in particular holds if T admits a semigroup ordering with the order-type of...
متن کاملOn a remarkable semigroup of homomorphisms with respect to free multiplicative convolution
Let M denote the space of Borel probability measures on R. For every t ≥ 0 we consider the transformation Bt : M → M defined by Bt(μ) = ( μ )⊎(1/(1+t)) , μ ∈ M, where ⊞ and ⊎ are the operations of free additive convolution and respectively of Boolean convolution on M, and where the convolution powers with respect to ⊞ and ⊎ are defined in the natural way. We show that Bs ◦ Bt = Bs+t, ∀ s, t ≥ 0...
متن کاملAdditivity of Jordan Triple Product Homomorphisms on Generalized Matrix Algebras
In this article, it is proved that under some conditions every bijective Jordan triple product homomorphism from generalized matrix algebras onto rings is additive. As a corollary, we obtain that every bijective Jordan triple product homomorphism from Mn(A) (A is not necessarily a prime algebra) onto an arbitrary ring R is additive.
متن کاملOn Homomorphisms of Matrix Algebras of Continuous Functions
If X is a topological space we denote by C(X) ® Mn the algebra of continuous functions from X to the algebra Mn of n x n complex matrices. A complete characterization of those topological spaces Y is given (in terms of vector bundles on Y) such that each unital algebrahomomorphism Φ: C(X) Θ Mn —• C(Y) Mkn is of the form a o (Φ' ® idΛ) for some homomorphism Φ': C(X) -+ C(Y) ® Λ/* and some su...
متن کاملOn the Computational Complexity of Matrix Semigroup Problems
Most computational problems for matrix semigroups and groups are inherently difficult to solve and even undecidable starting from dimension three. The questions about the decidability and complexity of problems for two-dimensional matrix semigroups remain open and are directly linked with other challenging problems in the field. In this paper we study the computational complexity of the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00503-1