Let $${\cal M}$$ be an n-cluster tilting subcategory of mod-Λ, where Λ is Artin algebra. S}({\cal M})$$ denote the full S}(\Lambda )$$ , submodule category Λ, consisting all monomorphisms in . We construct two functors from to $$\bmod - \underline {\cal M} $$ finitely presented additive contravariant on stable show that these are full, dense and objective hence provide equivalences between quot...

In this paper, we study some properties of φ-prime submodules andwe give another charactrization for it. For given N and K a moduleM with ⊆ N, prove that is submodule if only N/Kis φ_K-prime submodule. Finally, show any finite sum isφ-prime.

The notion of intuitinitic (T, S)-fuzzy submodule in Module is introduced, and related properties are investigated. Mathematics Subject Classification: 08A72, 13C99

in this paper, the notion of fully idempotent modules is defined and it is shown that this notion inherits most of the essential properties of the usual notion of von neumann's regular rings. furthermore, we introduce the dual notion of fully idempotent modules (that is, fully coidempotent modules) and investigate some properties of this class of modules.

In this article, we formalize a free Z-module and its property. In particular, we formalize the vector space of rational field corresponding to a free Z-module and prove formally that submodules of a free Z-module are free. Z-module is necassary for lattice problems LLL (Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic systems with lattice [20]. Some theorems in this arti...

In this paper we characterize the radical of an arbitrary‎ ‎submodule $N$ of a finitely generated free module $F$ over a‎ ‎commutatitve ring $R$ with identity‎. ‎Also we study submodules of‎ ‎$F$ which satisfy the radical formula‎. ‎Finally we derive‎ ‎necessary and sufficient conditions for $R$ to be a‎ ‎Pr$ddot{mbox{u}}$fer domain‎, ‎in terms of the radical of a‎ ‎cyclic submodule in $Rbigopl...

In this paper, we consider the problem of extending existing submodule construction techniques that have been developed for finite state models into more expressive and compact behavioral models that handle data through parameterized interactions, state variables and simple guards. We provide a behavioral model based on extended Input-Output Automata and describe an algorithm that provides the ...