Closable multipliers

Let $(X,\mu)$ and $(Y,\nu)$ be standard measure spaces. A function $\nph\in L^\infty(X\times Y,\mu\times\nu)$ is called a (measurable) Schur multiplier if the map $S_\nph$, defined on the space of Hilbert-Schmidt operators from $L_2(X,\mu)$ to $L_2(Y,\nu)$ by multiplying their integral kernels by $\nph$, is bound-ed in the operator norm. The paper studies measurable functions $\nph$ for which $S_\nph$ is closable in the norm topology or in the weak* topology. We obtain a characterisation of w*-closable multipliers and relate the question about norm closability to the theory of operator synthesis. We also study multipliers of two special types: if $\nph$ is of Toeplitz type, that is, if $\nph(x,y)=f(x-y)$, $x,y\in G$, where $G$ is a locally compact abelian group, then the closability of $\nph$ is related to the local inclusion of $f$ in the Fourier algebra $A(G)$ of $G$. If $\nph$ is a divided difference, that is, a function of the form $(f(x)-f(y))/(x-y)$, then its closability is related to the ``operator smoothness'' of the function $f$. A number of examples of non closable, norm closable and w*-closable multipliers are presented.

Multipliers of multidimensional Fourier algebras

Let $G$ be a locally compact $\sigma$-compact group. Motivated by an earlier notion for discrete groups due to Effros and Ruan, we introduce the multidimensional Fourier algebra $A^n(G)$ of $G$. We characterise the completely bounded multidimensional multipliers associated with $A^n(G)$ in several equivalent ways. In particular, we establish a completely isometric embedding of the space of all $n$-dimensional completely bounded multipliers into the space of all Schur multipliers on $G^{n+1}$ with respect to the (left) Haar measure. We show that in the case $G$ is amenable the space of completely bounded multidimensional multipliers coincides with the multidimensional Fourier-Stieltjes algebra of $G$ introduced by Ylinen. We extend some well-known results for abelian groups to the multidimensional setting.

Tensor products of operator systems

The purpose of the present paper is to lay the foundations for a systematic study of tensor products of operator systems. After giving an axiomatic definition of tensor products in this category, we examine in detail several particular examples of tensor products, including a minimal, maximal, maximal commuting, maximal injective and some asymmetric tensor products. We characterize these tensor products in terms of their universal properties and give descriptions of their positive cones. We also characterize the corresponding tensor products of operator spaces induced by a certain canonical inclusion of an operator space into an operator system. We examine notions of nuclearity for our tensor products which, on the category of C*-algebras, reduce to the classical notion. We exhibit an operator system S which is not completely order isomorphic to a C*-algebra yet has the property that for every C*-algebra A, the minimal and maximal tensor product of S and A are equal.

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.

Norm attaining operators and pseudospectrum

It is shown that if $11$, the operator $I+T$ attains its norm. A reflexive Banach space $X$ and a bounded rank one operator $T$ on $X$ are constructed such that $\|I+T\|>1$ and $I+T$ does not attain its norm.

Operators, commuting with the Volterra operator, are not weakly supercyclic

We prove that any bounded linear operator on $L_p[0,1]$ for $1\leq p

A splitting result for the algebraic K-theory of projective toric schemes

Suppose X is a projective toric scheme defined over a ring R and equipped with an ample line bundle L . We prove that its K-theory has a direct summand of the form K(R)(k+1) where k = 0 is minimal such that L?(-k-1) is not acyclic. Using a combinatorial description of quasi-coherent sheaves we interpret and prove this result for a ring R which is either commutative, or else left noetherian.

Luminescent Photoinduced Electron Transfer (PET) Molecules for Sensing and Logic Operations

Chemical species can serve as inputs to supramolecular devices so that a luminescence output is created in a conditional manner. Conditionality is built into these devices by employing the classical photochemical process of photoinduced electron transfer (PET) to compete with luminescence emission. The response of these devices in the analogue regime leads to sensors that can operate in nanometric, micrometric, and millimetric spaces. Some of these devices serve in membrane science, cell physiology, and medical diagnostics. The response in the digital regime leads to Boolean logic gates. Some of these find application in improving aspects of medical diagnostics and in identifying small objects in large populations.

Molecular Logic Gates and Luminescent Sensors Based on Photoinduced Electron Transfer

The competition between Photoinduced electron transfer (PET) and other de-excitation pathways such as fluorescence and phosphorescence can be controlled within designed molecular structures. Depending on the particular design, the resulting optical output is thus a function of various inputs such as ion concentration and excitation light dose. Once digitized into binary code, these input-output patterns can be interpreted according to Boolean logic. The single-input logic types of YES and NOT cover simple sensors and the double- (or higher-) input logic types represent other gates such as AND and OR. The logic-based arithmetic processors such as half-adders and half-subtractors are also featured. Naturally, a principal application of the more complex gates is in multi-sensing contexts.

C∗-Segal algebras with order unit

We introduce the notion of a (noncommutative) C *-Segal algebra as a Banach algebra (A, {norm of matrix}{dot operator}{norm of matrix} A) which is a dense ideal in a C *-algebra (C, {norm of matrix}{dot operator}{norm of matrix} C), where {norm of matrix}{dot operator}{norm of matrix} A is strictly stronger than {norm of matrix}{dot operator}{norm of matrix} C onA. Several basic properties are investigated and, with the aid of the theory of multiplier modules, the structure of C *-Segal algebras with order unit is determined.

Semiring induced valuation algebras: Exact and approximate local computation algorithms

Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra.There are many models of this algebraic structure ranging from probability theory to numerical analysis, relational databases and various classical and non-classical logics. It turns out that many interesting models of valuation algebras may be derived from semiring valued mappings. In this paper we study how valuation algebras are induced by semirings and how the structure of the valuation algebra is related to the algebraic structure of the semiring. In particular, c-semirings with idempotent multiplication induce idempotent valuation algebras and therefore permit particularly efficient architectures for local computation. Also important are semirings whose multiplicative semigroup is embedded in a union of groups. They induce valuation algebras with a partially defined division. For these valuation algebras, the well-known architectures for Bayesian networks apply. We also extend the general computational framework to allow derivation of bounds and approximations, for when exact computation is not feasible.

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.

Relevance and truthfulness in information correction and fusion

A general approach to information correction and fusion for belief functions is proposed, where not only may the information items be irrelevant, but sources may lie as well. We introduce a new correction scheme, which takes into account uncertain metaknowledge on the source’s relevance and truthfulness and that generalizes Shafer’s discounting operation. We then show how to reinterpret all connectives of Boolean logic in terms of source behavior assumptions with respect to relevance and truthfulness. We are led to generalize the unnormalized Dempster’s rule to all Boolean connectives, while taking into account the uncertainties pertaining to assumptions concerning the behavior of sources. Eventually, we further extend this approach to an even more general setting, where source behavior assumptions do not have to be restricted to relevance and truthfulness.We also establish the commutativity property between correction and fusion processes, when the behaviors of the sources are independent.