نتایج جستجو برای: quasi prufer domain

تعداد نتایج: 486674  

Journal: :Nagoya Mathematical Journal 1959

Journal: :bulletin of the iranian mathematical society 2011
m. behboodi r. jahani-nezhad m. h. naderi

in this paper we introduce the notion of classical quasi-primary submodules that generalizes the concept of classical primary submodules. then, we investigate decomposition and minimal decomposition into classical quasi-primary submodules. in particular, existence and uniqueness of classical quasi-primary decompositions in finitely generated modules over noetherian rings are proved. moreover, w...

Journal: :Journal of Software Engineering and Applications 2009

Journal: :iranian journal of fuzzy systems 2010
dorel mihet

we provide fuzzy quasi-metric versions of a fixed point theorem ofgregori and sapena for fuzzy contractive mappings in g-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.

2012
Tanu Gupta Anil Kumar

Many of the network topology design problems include CMST, which means to find a minimum cost tree that connects all the nodes of the network to the central node with some capacity constraint. The links of edges have associated costs that could be based on their distance, capacity, quality of line etc, and the nodes have their associated demand. Usually most of the network obtained from CMST ar...

2010
JOHN H. BARRETT

Presented to the Society, December, 1955 under the title ^4 necessary condition for nonoscillation of a system of second order differential equations, and August, 1956; received by the editors August 2, 1956. 1 These results were obtained while the author held a National Science Foundation grant, NSF-G1825 and was at Yale University. Now at the University of Utah. 2 This paper contains a biblio...

P. Sahandi

Let $D$ be an integral domain and $star$ a semistar operation stable and of finite type on it. We define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong S-domains. As an application, we give new characterizations of $star$-quasi-Pr"{u}fer domains and UM$t$ domains in terms of dimension inequal...

2000
William Edelson Michael L. Gargano

We solve by a genetic algorithm (GA), three NPhard, constrained, minimal spanning tree (MST) problems on a complete graph using a novel encoding for the genotype which ensures feasibility of the search space when performing crossover and mutation and when initializing the population. By employing a feasible encoding the standard, mainstream, GA paradigm is preserved allowing us to capture the f...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید