On subspace lattices II. Continuity of Lat

We study the continuity of the map Lat sending an ultraweakly closed operator algebra to its invariant subspace lattice. We provide an example showing that Lat is in general discontinuous and give sufficient conditions for the restricted continuity of this map. As consequences we obtain that Lat is continuous on the classes of von Neumann and Arveson algebras and give a general approximative criterion for reflexivity, which extends Arvesonâ??s theorem on the reflexivity of commutative subspace lattices.

Time operators for one parameter semigroups

We develop two simple approaches to the construction of time operators for semigroups of continuous linear operators in Hilbert spaces provided that the generators of these semigroups are normal operators. The first approach enables us to give explicit formulas (in the spectral representations) both for the time operators and for their eigenfunctions. The other approach provides no explicit formula. However, it enables us to find necessary and sufficient conditions for the existence of time operators for semigroups of continuous linear operators in separable Hilbert spaces with normal generators. Time superoperators corresponding to unitary groups are also discussed.

Structure of spectra of linear operators in Banach spaces

Descriptive characterizations of the point, the continuous, and the residual spectra of operators in Banach spaces are put forward. In particular, necessary and sufficient conditions for three disjoint subsets of the complex plane to be the point spectrum, the continuous spectrum, and the residual spectrum of a linear continuous operator in a separable Banach space are obtained.

Integral completeness of locally convex spaces

A locally convex space X is said to be integrally complete if each continuous mapping f: [0, 1] --> X is Riemann integrable. A criterion for integral completeness is established. Readily verifiable sufficient conditions of integral completeness are proved.

Compactness properties of operator multipliers

We continue the study of multidimensional operator multipliers initiated in~cite{jtt}. We introduce the notion of the symbol of an operator multiplier. We characterise completely compact operator multipliers in terms of their symbol as well as in terms of approximation by finite rank multipliers. We give sufficient conditions for the sets of compact and completely compact multipliers to coincide and characterise the cases where an operator multiplier in the minimal tensor product of two C*-algebras is automatically compact. We give a description of multilinear modular completely compact completely bounded maps defined on the direct product of finitely many copies of the C*-algebra of compact operators in terms of tensor products, generalising results of Saar

On the weak amenability of β(X)

We investigate the weak amenability of the Banach algebra ß(X) of all bounded linear operators on a Banach space X. Sufficient conditions are given for weak amenability of this and other Banach operator algebras with bounded one-sided approximate identities.

Partial Cooperative Equilibria: Existence and Characterization

We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.

On the simplicial cohomology of Banach operator algebras

We investigate the simplicial cohomology of certain Banach operator algebras. The two main examples considered are the Banach algebra of all bounded operators on a Banach space and its ideal of approximable operators. Sufficient conditions will be given forcing Banach algebras of this kind to be simplicially trivial.

When is the second local multiplier algebra of a C*-algebra equal to the first?

We discuss necessary as well as sufficient conditions for the second iterated local multiplier algebra of a separable C*-algebra to agree with the first.

Computational techniques for a simple theory of conditional preferences

A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences.

Fraternities and Labor Market Outcomes

We model how student choices to rush a fraternity, and fraternity admission choices, interact with signals firms receive about student productivities to determine labor-market outcomes. The fraternity and students value wages and fraternity socializing values. We provide sufficient conditions under which, in equilibrium, most members have intermediate abilities: weak students apply, but are rejected unless they have high socializing values, while most able students do not apply to avoid taint from association with weaker members.

Operator systems from discrete groups

We express various sets of quantum correlations studied in the theoretical physics literature in terms of different tensor products of operator systems of discrete groups. We thus recover earlier results of Tsirelson and formulate a new approach for the study of quantum correlations. To do this we formulate a general framework for the study of operator systems arising from discrete groups. We study in detail the operator system of the free group Fn on n generators, as well as the operator systems of the free products of finitely many copies of the two-element group Z2. We examine various tensor products of group operator systems, including the minimal, the maximal, and the commuting tensor products. We introduce a new tensor product in the category of operator systems and formulate necessary and sufficient conditions for its equality to the commuting tensor product in the case of group operator systems.

Rational Partial Choice Functions and Their Application to Belief Revision.

Necessary and sufficient conditions for choice functions to be rational have been intensively studied in the past. However, in these attempts, a choice function is completely specified. That is, given any subset of options, called an issue, the best option over that issue is always known, whilst in real-world scenarios, it is very often that only a few choices are known instead of all. In this paper, we study partial choice functions and investigate necessary and sufficient rationality conditions for situations where only a few choices are known. We prove that our necessary and sufficient condition for partial choice functions boils down to the necessary and sufficient conditions for complete choice functions proposed in the literature. Choice functions have been instrumental in belief revision theory. That is, in most approaches to belief revision, the problem studied can simply be described as the choice of possible worlds compatible with the input information, given an agent’s prior belief state. The main effort has been to devise strategies in order to infer the agents revised belief state. Our study considers the converse problem: given a collection of input information items and their corresponding revision results (as provided by an agent), does there exist a rational revision operation used by the agent and a consistent belief state that may explain the observed results?

Biotransformation of 2,4,6-trinitrotoluene (TNT) by ectomycorrhizal basidiomycetes

The ability of four ectomycorrhizal basidiomycetes to biotransform 2,4,6-trinitrotoluene (TNT) in axenic culture was tested. All species were capable of TNT biotransformation to a greater or lesser extent. When biotransformation was expressed on a biomass basis 4 out of the 5 isolates tested were equally efficient at transforming TNT. The factors regulating TNT biotransformation were investigated in detail for one fungus, Suillus variegatus. When the fungus was grown under nitrogen limiting conditions the rate of biotransformation decreased relative to nitrogen sufficient conditions, but no decrease was observed under short term carbon starvation. Extracellular enzymes of S. variegatus could transform TNT, but transformation was greater in intact cells. The mycelial cell wall fraction did not degrade TNT. The TNT concentration that caused 50% reduction in biomass (EC₅₀) for S. variegatus was within the range observed for other basidiomycete fungi being between 2-10 μg mL^-1. The potential use of ectomycorrhizal basidiomycetes as in-situ bioremediation agents for TNT contaminated soils is discussed.

Beam division multiple access transmission for massive MIMO communications

We study multicarrier multiuser multiple-input multiple-output (MU-MIMO) systems, in which the base station employs an asymptotically large number of antennas. We analyze a fully correlated channel matrix and provide a beam domain channel model, where the channel gains are independent of sub-carriers. For this model, we first derive a closed-form upper bound on the achievable ergodic sum-rate, based on which, we develop asymptotically necessary and sufficient conditions for optimal downlink transmission that require only statistical channel state information at the transmitter. Furthermore, we propose a beam division multiple access (BDMA) transmission scheme that simultaneously serves multiple users via different beams. By selecting users within non-overlapping beams, the MU-MIMO channels can be equivalently decomposed into multiple single-user MIMO channels; this scheme significantly reduces the overhead of channel estimation, as well as, the processing complexity at transceivers. For BDMA transmission, we work out an optimal pilot design criterion to minimize the mean square error (MSE) and provide optimal pilot sequences by utilizing the Zadoff-Chu sequences. Simulations demonstrate the near-optimal performance of BDMA transmission and the advantages of the proposed pilot sequences.