Displaying similar documents to “On multipliers for BMO φ on general domains.”

Multipliers of sequence spaces

Raymond Cheng, Javad Mashreghi, William T. Ross (2017)

Concrete Operators

Similarity:

This paper is selective survey on the space lAp and its multipliers. It also includes some connections of multipliers to Birkhoff-James orthogonality

Pointwise multipliers on weighted BMO spaces

Eiichi Nakai (1997)

Studia Mathematica

Similarity:

Let E and F be spaces of real- or complex-valued functions defined on a set X. A real- or complex-valued function g defined on X is called a pointwise multiplier from E to F if the pointwise product fg belongs to F for each f ∈ E. We denote by PWM(E,F) the set of all pointwise multipliers from E to F. Let X be a space of homogeneous type in the sense of Coifman-Weiss. For 1 ≤ p < ∞ and for ϕ : X × ℝ + → ℝ + , we denote by b m o ϕ , p ( X ) the set of all functions f ∈ L l o c p ( X ) such that s u p a ∈ X , r > 0 1 / ϕ ( a , r ) ( 1 / μ ( B ( a , r ) ) ʃ B ( a , r ) | f ( x ) - f B ( a , r ) | p d μ ) 1 / p < ∞ , where B(a,r) is the ball centered...

Schur and operator multipliers

Ivan G. Todorov, Lyudmila Turowska (2010)

Banach Center Publications

Similarity:

The present article is a survey of known results on Schur and operator multipliers. It starts with the classical description of Schur multipliers due to Grothendieck, followed by a discussion of measurable Schur multipliers and a generalisation of Grothendieck's Theorem due to Peller. Thereafter, a non-commutative version of Schur multipliers, called operator multipliers and introduced by Kissin and Schulman, is discussed, and a characterisation extending the description in the commutative...

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented...