When are multiplicative semi-derivations additive?

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Mohammad Aslam Siddeeque ◽  
Nazim Khan
Keyword(s):  
Associative Ring ◽  
Complex Numbers

Abstract Let R be an associative ring. A multiplicative semi-derivation d is a map on R satisfying d ⁢ ( x ⁢ y ) = d ⁢ ( x ) ⁢ g ⁢ ( y ) + x ⁢ d ⁢ ( y ) = d ⁢ ( x ) ⁢ y + g ⁢ ( x ) ⁢ d ⁢ ( y )   and   d ⁢ ( g ⁢ ( x ) ) = g ⁢ ( d ⁢ ( x ) ) {d(xy)=d(x)g(y)+xd(y)=d(x)y+g(x)d(y)\quad\text{and}\quad d(g(x))=g(d(x))} for all x , y ∈ R {x,y\in R} , where g is any map on R. In this paper, we have obtained some conditions on R, which make d additive. Finally, we have also shown that every multiplicative semi-derivation on M n ⁢ ( ℂ ) {M_{n}(\mathbb{C})} , the algebra of all n × n {n\times n} matrices over the field ℂ {\mathbb{C}} of complex numbers, is an additive derivation.

Complex numbers

2006 ◽  
Author(s):  
Stephen C. Roy
Keyword(s):  
Complex Numbers

Cline’s formula for g-Drazin inverses in a ring

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2249-2255
Author(s):  
Huanyin Chen ◽  
Marjan Abdolyousefi
Keyword(s):  
Operator Theory ◽  
Spectral Properties ◽  
Associative Ring ◽  
Linear Operators ◽  
Drazin Inverse ◽  
Bounded Linear Operators ◽  
Bounded Linear ◽  
Cline’S Formula

It is well known that for an associative ring R, if ab has g-Drazin inverse then ba has g-Drazin inverse. In this case, (ba)d = b((ab)d)2a. This formula is so-called Cline?s formula for g-Drazin inverse, which plays an elementary role in matrix and operator theory. In this paper, we generalize Cline?s formula to the wider case. In particular, as applications, we obtain new common spectral properties of bounded linear operators.

Extensions of Rings Having McCoy Condition

2009 ◽  
Vol 52 (2) ◽  
pp. 267-272 ◽  
Author(s):  
Muhammet Tamer Koşan
Keyword(s):  
Positive Integer ◽  
Associative Ring ◽  
Nonzero Element ◽  
Ring Extensions

AbstractLet R be an associative ring with unity. Then R is said to be a right McCoy ring when the equation f (x)g(x) = 0 (over R[x]), where 0 ≠ f (x), g(x) ∈ R[x], implies that there exists a nonzero element c ∈ R such that f (x)c = 0. In this paper, we characterize some basic ring extensions of right McCoy rings and we prove that if R is a right McCoy ring, then R[x]/(xn) is a right McCoy ring for any positive integer n ≥ 2.

On higher order Fibonacci hyper complex numbers

2021 ◽  
Vol 148 ◽  
pp. 111044
Author(s):  
Can Kızılateş ◽  
Tiekoro Kone
Keyword(s):  
Higher Order ◽  
Complex Numbers

scholarly journals Understanding mathematics of Grover’s algorithm

2021 ◽  
Vol 20 (5) ◽  
Author(s):  
Paweł J. Szabłowski
Keyword(s):  
Phase Change ◽  
Unitary Operator ◽  
Mathematical Structure ◽  
Complex Numbers ◽  
Unitary Operators ◽  
Grover’S Algorithm ◽  
Great Probability ◽  
Grover's Algorithm ◽  
One Step ◽  
The One

AbstractWe analyze the mathematical structure of the classical Grover’s algorithm and put it within the framework of linear algebra over the complex numbers. We also generalize it in the sense, that we are seeking not the one ‘chosen’ element (sometimes called a ‘solution’) of the dataset, but a set of m such ‘chosen’ elements (out of $$n>m)$$ n > m ) . Besides, we do not assume that the so-called initial superposition is uniform. We assume also that we have at our disposal an oracle that ‘marks,’ by a suitable phase change $$\varphi $$ φ , all these ‘chosen’ elements. In the first part of the paper, we construct a unique unitary operator that selects all ‘chosen’ elements in one step. The constructed operator is uniquely defined by the numbers $$\varphi $$ φ and $$\alpha $$ α which is a certain function of the coefficients of the initial superposition. Moreover, it is in the form of a composition of two so-called reflections. The result is purely theoretical since the phase change required to reach this heavily depends on $$\alpha $$ α . In the second part, we construct unitary operators having a form of composition of two or more reflections (generalizing the constructed operator) given the set of orthogonal versors. We find properties of these operations, in particular, their compositions. Further, by considering a fixed, ‘convenient’ phase change $$\varphi ,$$ φ , and by sequentially applying the so-constructed operator, we find the number of steps to find these ‘chosen’ elements with great probability. We apply this knowledge to study the generalizations of Grover’s algorithm ($$m=1,\phi =\pi $$ m = 1 , ϕ = π ), which are of the form, the found previously, unitary operators.

scholarly journals Toeplitz nonnegative realization of spectra via companion matrices

2019 ◽  
Vol 7 (1) ◽  
pp. 230-245
Author(s):  
Macarena Collao ◽  
Mario Salas ◽  
Ricardo L. Soto
Keyword(s):  
Eigenvalue Problem ◽  
Half Plane ◽  
Toeplitz Matrix ◽  
Toeplitz Matrices ◽  
Nonnegative Matrix ◽  
Inverse Eigenvalue Problem ◽  
Complex Numbers ◽  
Inverse Eigenvalue ◽  
Companion Matrices ◽  
Solution Matrix

Abstract The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}. If the problem has a solution, we say that Λ is realizable and that A is a realizing matrix. In this paper we consider the NIEP for a Toeplitz realizing matrix A, and as far as we know, this is the first work which addresses the Toeplitz nonnegative realization of spectra. We show that nonnegative companion matrices are similar to nonnegative Toeplitz ones. We note that, as a consequence, a realizable list Λ= {λ1, . . ., λn} of complex numbers in the left-half plane, that is, with Re λi≤ 0, i = 2, . . ., n, is in particular realizable by a Toeplitz matrix. Moreover, we show how to construct symmetric nonnegative block Toeplitz matrices with prescribed spectrum and we explore the universal realizability of lists, which are realizable by this kind of matrices. We also propose a Matlab Toeplitz routine to compute a Toeplitz solution matrix.

EIGENVALUES OF FIBONACCI STOCHASTIC ADDING MACHINE

2010 ◽  
Vol 10 (02) ◽  
pp. 291-313 ◽  
Author(s):  
A. MESSAOUDI ◽  
D. SMANIA
Keyword(s):  
Julia Set ◽  
Transition Operator ◽  
Complex Numbers ◽  
Topological Properties

In this work, we compute the eigenvalues of the transition operator associated to the Fibonacci stochastic adding machine. In particular, we show that the eigenvalues are connected to the set [Formula: see text] of complex numbers z where (z2, z) belongs to the filled Julia set of a particular endomorphism of ℂ2. We also study some topological properties of the set [Formula: see text].

scholarly journals Winding Numbers, Unwinding Numbers, and the Lambert W Function

2021 ◽  
Author(s):  
A. F. Beardon
Keyword(s):  
Complex Plane ◽  
Complex Number ◽  
Lambert W Function ◽  
Complex Numbers ◽  
Winding Number ◽  
Line Integral ◽  
Complex Functions

AbstractThe unwinding number of a complex number was introduced to process automatic computations involving complex numbers and multi-valued complex functions, and has been successfully applied to computations involving branches of the Lambert W function. In this partly expository note we discuss the unwinding number from a purely topological perspective, and link it to the classical winding number of a curve in the complex plane. We also use the unwinding number to give a representation of the branches $$W_k$$ W k of the Lambert W function as a line integral.

Sign in / Sign up

Export Citation Format

Share Document