scholarly journals Viewing *-multiplication operators between Orlicz spaces

Filomat ◽  
2020 ◽  
Vol 34 (7) ◽  
pp. 2185-2191
Author(s):  
Jahangir Cheshmavar ◽  
Seyed Hosseini
Keyword(s):  
Conditional Expectation ◽  
Orlicz Spaces ◽  
Multiplication Operators ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Closed Range ◽  
Necessary And Sufficient

In this paper, Lambert multipliers acting between Orlicz spaces are characterized based on some properties of conditional expectation operators. We provide a necessary and sufficient condition for the *-multiplication operators to have closed range. Finally, a necessary condition for Fredholmness of these type of operators will be investigated.

scholarly journals Syarat Perlu dan Cukup untuk Keterbatasan Potensial Riesz di Ruang Morrey Klasik

2013 ◽  
Vol 14 (3) ◽  
pp. 227
Author(s):  
Mohammad Imam Utoyo ◽  
Basuki Widodo ◽  
Toto Nusantara ◽  
Suhariningsih Suhariningsih
Keyword(s):  
Characteristic Function ◽  
Morrey Space ◽  
Necessary Conditions ◽  
Riesz Potential ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Research Results ◽  
Necessary And Sufficient

This script was aimed to determine the necessary conditions for boundedness of Riesz potential in the classical Morrey space. If these results are combined with previous research results will be obtained the necessary and sufficient condition for boundedness of Riesz potential. This necessary condition is obtained through the use of characteristic function as one member of the classical Morrey space.

scholarly journals ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS

2012 ◽  
Vol 22 (06) ◽  
pp. 1250052 ◽  
Author(s):  
ALI AKHAVI ◽  
INES KLIMANN ◽  
SYLVAIN LOMBARDY ◽  
JEAN MAIRESSE ◽  
MATTHIEU PICANTIN
Keyword(s):  
Decision Problem ◽  
Decision Procedure ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Mealy Automata ◽  
Necessary And Sufficient ◽  
New Criteria

This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskiĭ, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for finiteness and, for groups, an effective necessary but not sufficient condition. The efficiency of the new criteria is demonstrated by testing all Mealy automata with small stateset and alphabet. Finally, for groups, we provide a necessary and sufficient condition that does not directly lead to a decision procedure.

The necessary and sufficient condition for clustering of nodes based on the signs of connections in generalized signed networks

2019 ◽  
Vol 33 (10) ◽  
pp. 1950086
Author(s):  
Qi Wang ◽  
Yinhe Wang ◽  
Zilin Gao ◽  
Lili Zhang ◽  
Wenli Wang
Keyword(s):  
Clustering Algorithms ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Signed Networks ◽  
Clustering Problem ◽  
Structural Hole ◽  
Signed Network ◽  
Necessary And Sufficient ◽  
Sufficient And Necessary Condition

This paper investigates the clustering problem for the generalized signed networks. By rigorous derivations, a sufficient and necessary condition for clustering of the nodes in generalized signed networks is proposed in this paper. In order to obtain this condition, the concept of friends group is first introduced for the nodes based on their links’ sign. Then, the unprivileged network is also defined in this paper by employing the concepts of structural hole and broker. Compared with the existing clustering algorithms, the outstanding advantage in this paper is that only the positive or negative (especially, or zero) sign of the links is required regardless of their density or sparsity. We have proved mathematically that a generalized signed network is classifiable if and only if it is an unprivileged network. Finally, two examples associated with numerical simulations are proposed to generate the unprivileged networks.

scholarly journals THE FINITE SUM OF THE PRODUCTS OF TWO TOEPLITZ OPERATORS

2009 ◽  
Vol 86 (1) ◽  
pp. 45-60 ◽  
Author(s):  
XUANHAO DING
Keyword(s):  
Toeplitz Operator ◽  
Finite Rank ◽  
Toeplitz Operators ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finite Rank Perturbation ◽  
Sum Of Products ◽  
Finite Sum ◽  
Necessary And Sufficient

AbstractWe consider in this paper the question of when the finite sum of products of two Toeplitz operators is a finite-rank perturbation of a single Toeplitz operator on the Hardy space over the unit disk. A necessary condition is found. As a consequence we obtain a necessary and sufficient condition for the product of three Toeplitz operators to be a finite-rank perturbation of a single Toeplitz operator.

scholarly journals On Modelling AM/AM and AM/PM Conversions via Volterra Series

2016 ◽  
Vol 62 (3) ◽  
pp. 267-272
Author(s):  
Andrzej Borys ◽  
Wiesław Sieńko
Keyword(s):  
Power Amplifiers ◽  
Transfer Functions ◽  
Volterra Series ◽  
Polynomial Coefficient ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Nonlinear Transfer ◽  
Necessary And Sufficient ◽  
Nonzero Polynomial

Abstract In this paper, we present the expressions, not published up to now, that describe the AM/AM and AM/PM conversions of communication power amplifiers (PAs) via the Volterra series based nonlinear transfer functions. Furthermore, we present a necessary and sufficient condition of occurrence of the nonzero values of AM/PM conversion in PAs. Moreover, it has been shown that Saleh’s approach and related ones, which foresee nonzero level of AM/PM conversion, are not models without memory. It has been also shown that using a polynomial description of a PA does not lead to a nonzero AM/PM conversion. Moreover, a necessary condition of occurrence of an AM/AM conversion in this kind of modelling is existence of at least one nonzero polynomial coefficient associated with its odd terms of degree greater than one.

scholarly journals Some results concerning frames in Banach spaces

2007 ◽  
Vol 38 (3) ◽  
pp. 267-276 ◽  
Author(s):  
S. K. Kaushik
Keyword(s):  
Finite Number ◽  
Banach Spaces ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Linearly Independent ◽  
Banach Frame ◽  
Minimal Sequence ◽  
Definition Of ◽  
Necessary And Sufficient

A necessary and sufficient condition for the associated sequence of functionals to a complete minimal sequence to be a Banach frame has been given. We give the definition of a weak-exact Banach frame, and observe that an exact Banach frame is weak-exact. An example of a weak-exact Banach frame which is not exact has been given. A necessary and sufficient condition for a Banach frame to be a weak-exact Banach frame has been obtained. Finally, a necessary condition for the perturbation of a retro Banach frame by a finite number of linearly independent vectors to be a retro Banach frame has been given.

Analysing Willerding’s formula for solving the planar three point resection problem

2019 ◽  
Vol 13 (1) ◽  
pp. 27-31
Author(s):  
Gerhard Heindl
Keyword(s):  
Mathematical Problem ◽  
Autonomous Robot ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Robot Localization ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

Abstract The main mathematical problem in the planar three point resection problem of surveying is to find a necessary and sufficient condition that a point on a plane is uniquely determined if the directions from that point to three given points are known only up to an unknown offset. It will be shown in this paper that such a condition is the applicability of Willerding’s formula for computing the point in question, and that this condition is equivalent to the well-known necessary condition that the four considered points are not located on a circle or a line. Because of this result, the easy evaluation and the short derivation of Willerding’s formula, it can be expected, that this formula will be widely used in surveying, and also for autonomous robot localization.

On An Affine Connection Which Admits A Volume-Like Form

1990 ◽  
Vol 33 (4) ◽  
pp. 482-488 ◽  
Author(s):  
D. P. Chi ◽  
Y. D. Yoon
Keyword(s):  
Affine Connection ◽  
Riemannian Metric ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Riemannian Connection ◽  
Cech Cohomology ◽  
Necessary And Sufficient

AbstractA necessary and sufficient condition to obtain a volumelike form from an affine connection is given in terms of the Čech cohomology, after the volume-like form is naturally defined without a Riemannian metric. A necessary condition for an affine connection to be a Riemannian connection for some metric is also given.

Hidden Markov Processes: The Complete Realization Problem

2014 ◽  
Author(s):  
M. Vidyasagar
Keyword(s):  
Markov Processes ◽  
Hidden Markov ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Rank Condition ◽  
Mixing Processes ◽  
Realization Problem ◽  
Hidden Markov Processes ◽  
Necessary And Sufficient

This chapter considers hidden Markov processes (HMPs), focusing on the so-called complete realization problem. It is quite easy to prove a universal necessary condition for the given process to have a hidden Markov model (HMM). However, this condition is not sufficient in general. In principle, one can derive a “necessary and sufficient condition,” but the “necessary and sufficient condition” is virtually a restatement of the problem to be solved and does not shed any insight into the solution. The chapter first introduces a very useful matrix known as the “Hankel” matrix before discussing the nonsufficiency of the finite Hankel rank condition, an abstract necessary and sufficient condition, and the existence of regular quasi-realizations. It also describes the spectral properties of alpha-mixing processes and goes on to analyze ultra-mixing processes and a sufficient condition for the existence of HMMs.

scholarly journals Sufficient and Necessary Condition to Decide Compatibility for a Class of Interorganizational Workflow Nets

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Guanjun Liu ◽  
Lijing Chen
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Workflow Nets ◽  
Well Model ◽  
Multiple Processes ◽  
Necessary And Sufficient ◽  
Sufficient And Necessary Condition

Interorganizational Workflow nets (IWF-nets) can well model many concurrent systems such as web service composition, in which multiple processes interact via sending/receiving messages. Compatibility of IWF-nets is a crucial criterion for the correctness of these systems. It guarantees that a system has no deadlock, livelock, or dead tasks. In our previous work we proved that the compatibility problem is PSPACE-complete for safe IWF-nets. This paper defines a subclass of IWF-nets that can model many cases about interactions. Necessary and sufficient condition is presented to decide their compatibility, and it depends on the net structures only. Finally, an algorithm is developed based on the condition.

Sign in / Sign up

Export Citation Format

Share Document