$n$-factorization Property of Bilinear Mappings

author

  • Sedigheh Barootkoob Department of Mathematics, Faculty of Basic Sciences, University of Bojnord, P.O. Box 1339, Bojnord, Iran.
Abstract:

In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on  a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of  level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity and also strong Arens irregularity. These results may help us to prove some previous  problems related to strong Arens irregularity more easier than old. These include some results proved by Neufang in ~cite{neu1} and ~cite{neu}.  Some applications to certain bilinear mappings on convolution algebras, on a locally compact group, are also included. Finally, some solutions related to  the Ghahramani-Lau conjecture is raised.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

arens regularity and factorization property

in this paper, we study the arens regularity properties of module actions and we extend some proposition from baker, dales, lau and others into general situations. we establish some relationships between the topological centers of module actions and factorization properties of them with some results in group algebras. in 1951 arens shows that the second dual of banach algebra endowed with the e...

full text

Surjective factorization of holomorphic mappings

We characterize the holomorphic mappings f between complex Banach spaces that may be written in the form f = T ◦ g, where g is another holomorphic mapping and T belongs to a closed surjective operator ideal.

full text

Synthesis of Property-Preserving Mappings

System development often involves decisions about how a high-level design is to be implemented using primitives from a low-level platform. Certain decisions, however, may introduce undesirable behavior into the resulting implementation, possibly leading to a violation of a desired property that has already been established at the design level. In this paper, we introduce the problem of synthesi...

full text

Factorization property of the deuteron.

Using a simple field-theoretic model we show that, in the zero binding limit, the relativistic deuteron wave function has a cluster decomposition; i.e., factors into two separate nucleon wave functions convoluted with a body wave function. The framework of the calculation is a Fock state expansion at equal time on the light-cone. Assuming a quark interchange mechanism, we then derive the deuter...

full text

Bilinear Factorization via Augmented Lagrange Multipliers

This paper presents a unified approach to solve different bilinear factorization problems in Computer Vision in the presence of missing data in the measurements. The problem is formulated as a constrained optimization problem where one of the factors is constrained to lie on a specific manifold. To achieve this, we introduce an equivalent reformulation of the bilinear factorization problem. Thi...

full text

Bilinear Parings in Property-based attestation

One of the objectives of trusted computing is to provide remote attestation method that is able to confirm the status of remote platform or application. Existing property-based attestation is based on the strong-RSA assumption and the required key length is too long. What’s more, a considerable number of RSA-length operations having to be performed which lead to low computational efficiency. Bi...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 17  issue 3

pages  161- 173

publication date 2020-07-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023