✦ LIBER ✦

Solution of two problems on cotorsion abelian groups

✍ Scribed by Rüdiger Göbel; Rainer Prelle

Book ID: 112500028
Publisher: Springer
Year: 1978
Tongue: English
Weight: 417 KB
Volume: 31
Category: Article
ISSN: 0003-889X
DOI: 10.1007/bf01226469

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-rigid classes of cotorsion-free abe

Semi-rigid classes of cotorsion-free abelian groups

✍ Rüdiger Göbel; Saharon Shelah 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 834 KB

Two problems onℵ0-indecomposable Abelian

Two problems onℵ0-indecomposable Abelian Groups

✍ Saharon Shelah; Alexander Soifer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Solution of Kaplansky's test problems fo

Solution of Kaplansky's test problems for primary abelian groups

✍ Peter Crawley 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 841 KB

On Groups which are the Product of Two A

On Groups which are the Product of Two Abelian Groups

✍ Holt, D. F.; Howlett, R. B. 📂 Article 📅 1984 🏛 Oxford University Press 🌐 English ⚖ 188 KB

Analysis of algorithms on problems in ge

Analysis of algorithms on problems in general abelian groups

✍ Costas S. Iliopoulos 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 394 KB

A Combinatorial Problem on Finite Abelia

A Combinatorial Problem on Finite Abelian Groups

✍ W.D. Gao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 186 KB

In this paper the following theorem is proved. Let G be a finite Abelian group of order n. Then, n+D(G )&1 is the least integer m with the property that for any sequence of m elements a 1 , ..., a m in G, 0 can be written in the form 0= a 1 + } } } +a in with 1 i 1 < } } } <i n m, where D(G) is the