Sharif Digital Repository

A classical question of Yoneda asks when the tensor product of two injective modules is injective. A complete answer to this question was given by Enochs and Jenda in 1991. In this paper the analogue question for pure-injective modules is studied  

In this note, we study the behavior of independent sets of maximum probability measure in tensor graph powers. To do this, we introduce an upper bound using measure preserving homomorphisms. This work extends some previous results concerning independence ratios of tensor graph powers. © 2008 Elsevier B.V. All rights reserved  

The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource... 

We introduce the concepts of cohering and decohering power of quantum channels. Using the axiomatic definition of the coherence measure, we show that the optimization required for calculations of these measures can be restricted to pure input states and hence greatly simplified. We then use two examples of this measure, one based on the skew information and the other based on the l1 norm; we find the cohering and decohering measures of a number of one-, two-, and n-qubit channels. Contrary to the view at first glance, it is seen that quantum channels can have cohering power. It is also shown that a specific property of a qubit unitary map is that it has equal cohering and decohering power in... 

The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource...