نتایج جستجو برای: totally reflexive
تعداد نتایج: 35672 فیلتر نتایج به سال:
In this paper, the notions of anti-reflexive kernel, symmetric kernel, reflexive closure, and symmetric closure of a soft set relation are first introduced, respectively. Then, their accurate calculation formulae and some properties are obtained. Finally, soft set relation mappings and inverse soft set relationmappings are proposed, and some related properties are discussed. © 2010 Elsevier Ltd...
Let 1 < q < p < ∞ and q ≤ r ≤ p. Let X be a reflexive Banach space satisfying a lower-lq-tree estimate and let T be a bounded linear operator from X which satisfies an upper-lp-tree estimate. Then T factors through a subspace of ( ∑ Fn)lr , where (Fn) is a sequence of finite-dimensional spaces. In particular, T factors through a subspace of a reflexive space with an (lp, lq) FDD. Similarly, let...
Let R be a commutative Noetherian ring. The k-torsionless modules are defined in [7] as a generalization of torsionless and reflexive modules, i.e., torsionless modules are 1-torsionless and reflexive modules are 2-torsionless. Some properties of torsionless, reflexive, and k-torsionless modules are investigated in this paper. It is proved that if M is an R-module such that G-dimR(M)
در این پایان نامه روش های ارائه شده توسط هررو1 و تم2 در سال 2011 در مقاله ای با عنوان using the gsvd and the lifthing technique to find {p,k+1} reflexive and anti-reflexive solutions of axb=c برای پیدا کردن جواب های انعکاسی و پاد-انعکاسی {p,k+?} معادله ماتریسی axb=c بیان شده اند را بررسی می کنیم. در پایان از این روش ها برای پیدا کردن جواب های {p,?k} انعکاسی معادله ی ماتریسی axb+cx^* e=f استف...
This paper provides computational algorithms for a Korean reflexive caki, for which both sentence-bound and long-distance readings are possible. Its analyses are based on Chierichia's theory in Categorial Grammar, and a CCG-like system is introduced for the implementation. In this system, we can get both readings of caki with the same resolution mechanisms, while the difference is where the ref...
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To noncommutative hypersurfaces, which are important objects algebraic geometry, we introduce a notion factorization for an arbitrary nonzero non-unit element ring. First show that the category graded invariant under operation called twist (this result generalization by Cassidy-Conner-Kirkman-Moore). Then g...
We present a wide class of reflexive, precompact, non-compact, Abelian topological groupsG determined by three requirements. They must have the Baire property, satisfy the open refinement condition, and contain no infinite compact subsets. This combination of properties guarantees that all compact subsets of the dual group G are finite. We also show that many (non-reflexive) precompact Abelian ...
in the present paper, we propose an iterative algorithm for solving the generalized $(p,q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} {underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$. by this iterative algorithm, the solvability of the problem can be determined automatically. when the matrix equation is consistent over...
In this paper, by using Bregman’s technique, we introduce and study the hybrid proximal-point methods for finding a common element of the set of solutions to a system of generalized equilibrium Problems and zeros of a finite family of maximal monotone operators in reflexive Banach spaces. Strong convergence results of the proposed hybrid proximal-point algorithms are also established under some...
Contravariantly finite resolving subcategories of the category of finitely generated modules have been playing an important role in the representation theory of algebras. In this paper we study contravariantly finite resolving subcategories over commutative rings. The main purpose of this paper is to classify contravariantly finite resolving subcategories over a henselian Gorenstein local ring;...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید