This paper studies the algorithms for coding and decoding Prufer codes of a labeled tree. The algorithms for coding and decoding Prufer codes of a labeled tree in the literatures require time usually. Although there exist linear time algorithms for Prufer-like codes [1,2,3], the algorithms utilize the integer sorting algorithms. The special range of the integers to be sorted is utilized to obta...

in this paper we investigate decompositions of submodules in modules over a proufer domain into intersections of quasi-primary and classical quasi-primary submodules. in particular, existence and uniqueness of quasi-primary decompositions in modules over a proufer domain of finite character are proved. proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decomposi...

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

In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...

Invertibility of multiplication modules All rings are commutative with 1 and all modules are unital. Let R be a ring and M an R-module. M is called multiplication if for each submodule N of M, N=IM for some ideal I of R. Multiplication modules have recently received considerable attention during the last twenty years. In this talk we give the de nition of invertible submodules as a natural gene...