As a continuation of the work on linear maps between operator algebras which preserve certain subsets of operators with finite rank, or finite corank, here we consider the problem inbetween, that is, we treat the question of preserving operators with infinite rank and infinite corank. Since, as it turns out, in this generality our preservers cannot be written in a nice form what we have got use...

in this study, combined effect of two essential oils, thymol and carvacrol, with different concentrations in two methods on gladiolous grandiflorous l. was investigated based on a completely randomized design with 3 replicates and four flower in each replicate. sansusi variety applied that was red. in short term method, different concentrations of thymol and carvacrolin including 25+25, 50+50 a...

Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, respectively. Since real-world networks are prone to failures, it makes sense to study fault-tolerant versions of the above structures. This turns out to be a surprisingly difficult task. For every small but arbitrary se...

Here we investigate the kinetics of water-assisted CVD (henceforth denoted as supergrowth CVD) by a quantitative time-evolution analysis based on a simple growth model. We found that the supergrowth can be well described by a model where the dynamics of the catalyst activity is treated similar to radioactive decay. An in-depth analysis based on this growth model revealed the kinetics of the sup...

Mutagenesis is a process which forces the coverage of certain zones of the search space during the generations of an evolution strategy, by keeping track of the covered ranges for the different variables in the so called gene matrix. Originally introduced as an artifact to control the automated stopping criterion in a memetic algorithm, ESLAT, it also improved the exploration capabilities of th...

The classification of preservers began about 100 years ago. In 1897, Frobenius characterized the linear operators on Mn which preserve certain matrix functions: those linear operators on Mn preserves the determinant and those preserves the characteristic polynomial (spectrum). He proved that if M M n n → : T is a linear transformation satisfying) det()) (T det(A A = , M A n ∈ , then either UAV ...

Let C be a complex field, H_{m_1m_2} linear space of tensor products Hermite matrices H_{m_1}⊗H_{m_2} over , and suppose m_{1}, m_2≥2 are positive integers. A map f :H_{m_1m_2} → H_n is called inverse preserver if f( X_{1} ⊗X_{2} )^{-1}= X_{1}⊗X_{2}) ^{-1} ) for arbitrary invertible matrix ⊗ X_{2}∈ H_{m_{1}m_{2}} .The aim this...

In this paper we generalize (finite) block diagonal matrices to infinite dimensions and then by using row stochastic (as a special case), define the relation < bdr on c0, which is said majorization. We also obtain some important properties of Pbdr, set all bounded linear operators T : c0 ? c0; preserve Further, it obtained necessary conditions for operator be preserver majorization bdr. Also...

The paper is devoted to the problem of classification of extremal positive maps acting between B(K) and B(H) where K and H are Hilbert spaces. It is shown that every positive map with the property that rankφ(P ) ≤ 1 for any one-dimensional projection P is a rank 1 preserver. It allows to characterize all decomposable extremal maps as those which satisfy the above condition. Further, we prove th...