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)

We use a correspondence between Graphs1 and finite subsets of certain semigroups (the factorial and commutative ones, for example R\{0} if R is a unique factorization domain) and the Graph Minor Theorem to get a characterization of infinite sequences of finite subsets of those semigroups. Especially interesting is the case if N is the regarded semigroup. 1. Some aspects of Graph (Minor) Theory ...

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...

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 ...

There exist many different calculi for rescribing interactive and sequential behaviour. The goal of action calculi [1] is to unify these calculi at a syntactic and operation level. We introduce a symmetric variant which extends the reach of action calculi to cover for example the Fusion calculus [2] and Yoshida’s process graphs [3]. These symmetric action calculi conservatively extend the refle...

We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to problems of recognizing frequent patterns ...

We study the relationship between the Mosco convergence of a sequence of convex proper lower semicontinuous functionals, defined on a reflexive Banach space, and the convergence of their subdifferentiels as maximal monotone graphs. We then apply these results together with the unfolding method (see [10]) to study the homogenization of equations of the form − div dε = f , with (∇uε(x), dε(x)) ∈ ...