Multiplication and composition operators between two 𝐿^{𝑝}-spaces

1999 ◽  
pp. 321-338 ◽  
Author(s):  
Hiroyuki Takagi ◽  
Katsuhiko Yokouchi
Keyword(s):  
Composition Operators

Essential norms of weighted differentiation composition operators between Zygmund type spaces and Bloch type spaces

Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2877-2889 ◽  
Author(s):  
Amir Sanatpour ◽  
Mostafa Hassanlou
Keyword(s):  
Composition Operators ◽  
Sufficient Conditions ◽  
Essential Norm ◽  
Necessary And Sufficient Conditions ◽  
Norm Estimates ◽  
Type Spaces ◽  
Necessary And Sufficient

We study boundedness of weighted differentiation composition operators Dk?,u between Zygmund type spaces Z? and Bloch type spaces ?. We also give essential norm estimates of such operators in different cases of k ? N and 0 < ?,? < ?. Applying our essential norm estimates, we get necessary and sufficient conditions for the compactness of these operators.

scholarly journals Compact Differences of Composition Operators on Bergman Spaces Induced by Doubling Weights

2021 ◽  
Author(s):  
Bin Liu ◽  
Jouni Rättyä ◽  
Fanglei Wu
Keyword(s):  
Bergman Space ◽  
Open Problem ◽  
Lebesgue Space ◽  
Composition Operators ◽  
Bergman Spaces ◽  
Weighted Bergman Space ◽  
Carleson Measures ◽  
Doubling Weights ◽  
The Way

AbstractBounded and compact differences of two composition operators acting from the weighted Bergman space $$A^p_\omega $$ A ω p to the Lebesgue space $$L^q_\nu $$ L ν q , where $$0<q<p<\infty $$ 0 < q < p < ∞ and $$\omega $$ ω belongs to the class "Equation missing" of radial weights satisfying two-sided doubling conditions, are characterized. On the way to the proofs a new description of q-Carleson measures for $$A^p_\omega $$ A ω p , with $$p>q$$ p > q and "Equation missing", involving pseudohyperbolic discs is established. This last-mentioned result generalizes the well-known characterization of q-Carleson measures for the classical weighted Bergman space $$A^p_\alpha $$ A α p with $$-1<\alpha <\infty $$ - 1 < α < ∞ to the setting of doubling weights. The case "Equation missing" is also briefly discussed and an open problem concerning this case is posed.

Adjoint of generalized Cesáro operators on analytic function spaces

2020 ◽  
Vol 26 (2) ◽  
pp. 185-192
Author(s):  
Sunanda Naik ◽  
Pankaj K. Nath
Keyword(s):  
Analytic Function ◽  
Convolution Operator ◽  
Composition Operators ◽  
Mixed Norm ◽  
Averaging Operators ◽  
Mixed Norm Spaces ◽  
Cesaro Averaging ◽  
Analytic Function Spaces ◽  
Appl Math ◽  
Two Parameter

AbstractIn this article, we define a convolution operator and study its boundedness on mixed-norm spaces. In particular, we obtain a well-known result on the boundedness of composition operators given by Avetisyan and Stević in [K. Avetisyan and S. Stević, The generalized Libera transform is bounded on the Besov mixed-norm, BMOA and VMOA spaces on the unit disc, Appl. Math. Comput. 213 2009, 2, 304–311]. Also we consider the adjoint {\mathcal{A}^{b,c}} for {b>0} of two parameter families of Cesáro averaging operators and prove the boundedness on Besov mixed-norm spaces {B_{\alpha+(c-1)}^{p,q}} for {c>1}.

scholarly journals Correct program parallelisations

2021 ◽  
Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari
Keyword(s):  
Composition Operators ◽  
Parallel Programs ◽  
Parallel Program ◽  
Tool Support ◽  
Intermediate Representation ◽  
Data Race ◽  
Sequential Program ◽  
Functional Correctness ◽  
Correct Program ◽  
Basic Blocks

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.

Sign in / Sign up

Export Citation Format

Share Document