A slant weighted Toeplitz operator Aφ is an operator on L(β) defined as Aφ = WMφ where Mφ is the weighted multiplication operator and W is an operator on L(β) given by We2n = βn β2n en, {en}n∈Z being the orthonormal basis. In this paper, we generalise Aφ to the k-th order slant weighted Toeplitz operator Uφ and study its properties. Keywords—Slant weighted Toeplitz operator, weighted multiplica...

We consider tractable representations of probability distributions and the polytime operations they support. In particular, we consider a recently proposed arithmetic circuit representation, the Probabilistic Sentential Decision Diagram (PSDD). We show that PSDDs support a polytime multiplication operator, while they do not support a polytime operator for summing-out variables. A polytime multi...

let  be a hilbert space of functions analytic on a plane domain  such that for every  in  the functional of evaluation at  is bounded. assume further that  contains the constants and admits multiplication by the independent variable , , as a bounded operator. we give sufficient conditions for  to be reflexive for all positive integers .

An operator family of densely defined closed linear operators and the multiplication operator associated with it are considered. The spectrum of this multiplication operator is expressed in terms of the spectra of the operators in the given family. Mathematics Subject Classification (2000). Primary 47A10; Secondary 47A56, 47B40, 47E05, 76B99.

In this paper, we investigate in a unified way the structural properties of solutions to inverse problems. These solutions are regularized by the generic class of semi-norms defined as a decomposable norm composed with a linear operator, the so-called analysis type decomposable prior. This encompasses several well-known analysis-type regularizations such as the discrete total variation (in any ...

Several choices for the hardware implementation of the modular multiplication operator are presented. It proposes a cost function to evaluate these design choices and compares them for the optimization of parameters such as area and execution time. This last parameter is very important in cryptographic applications, where the modular multiplication operator is widely used.