Journals / International Electronic Journal of Algebra / 2007 / Cilt: 2 - Sayı: 2

SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS

Pages
54–70
Publication Date
2007-12-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Thus, we give efficient methods, on one hand to check the properties of being direct summand, essential, superfluous, coessential, complement (closed), supplement (coclosed) subgroup, and on the other hand to determine all subgroups with the mentioned properties of a given finite abelian group.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:We develop algorithms for determining properties of finite abelian groups related to the notions of extending and lifting groups.
📊
Key Findings & Data:We develop algorithms for determining properties of finite abelian groups related to the notions of extending and lifting groups.
💡
Conclusion & Impact:Thus, we give efficient methods, on one hand to check the properties of being direct summand, essential, superfluous, coessential, complement (closed), supplement (coclosed) subgroup, and on the other hand to determine all subgroups with the mentioned properties of a given finite abelian group.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Subgroup lattice · essential subgroup · superfluous subgroup

Abstract

We develop algorithms for determining properties of finite abelian groups related to the notions of extending and lifting groups. Thus, we give efficient methods, on one hand to check the properties of being direct summand, essential, superfluous, coessential, complement (closed), supplement (coclosed) subgroup, and on the other hand to determine all subgroups with the mentioned properties of a given finite abelian group.

🔖

Cite This Article

CRİVEİ, S., SZÖLLOSİ, Ş. Ş. (2007). SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. International Electronic Journal of Algebra, Cilt: 2 - Sayı: 2, 54–70. https://ajindex.com/articles/832584

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (8)

  1. G. C˘alug˘areanu, S. Breaz, C. Modoi, C. Pelea and D. V˘alcan, Exercises in Abelian group theory, Kluwer Texts in the Mathematical Sciences, 25, Dor- drecht, Kluwer, 2003.
  2. J. Clark, C. Lomp, N. Vanaja and R. Wisbauer, Lifting modules. Supplements and projectivity in module theory. Frontiers in Mathematics, Birkh¨auser, Basel, S. Crivei, G. Olteanu and S¸. S¸uteu Sz¨oll˝osi, ELISA. A collec- tion of GAP algorithms related to extending and lifting abelian groups. (http://www.gap-system.org/Packages/undep.html) (http://math.ubbcluj.ro/~crivei/GAP_project).
  3. N.V. Dung, D.V. Huynh, P.F. Smith and R. Wisbauer, Extending modules, Pitman Research Notes in Mathematics Series, 313, Longman ScientiŞc and Technical, 1994.
  4. A. Harmancı, D. Keskin and P.F. Smith, On ⊕-supplemented modules, Acta Math. Hungar., 83 (1999), 161–169.
  5. D. Keskin and W. Xue, Generalizations of lifting modules, Acta Math. Hun- gar., 91 (2001), 253–261.
  6. E. Mermut, Homological approach to complements and supplements, Ph.D. thesis, Dokuz Eyl¨ul University, Izmir, 2004. S.H. Mohamed and B.J. M¨uller, Continuous and discrete modules, London Math. Soc. Lecture Notes Series, 147, Cambridge Univ. Press,
  7. Cambridge, P.F. Smith and A. Tercan, Generalizations of CS modules, Comm. Algebra, (1993), 1809–1847.
  8. The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.7; 2006, (http://www.gap-system.org). Septimiu Crivei * and S¸tefan S¸uteu Sz¨oll˝osi ** Faculty of Mathematics and Computer Science, Babe¸s-Bolyai University, Str. M. Kog˘alniceanu 1, 400084 Cluj-Napoca, Romania E-mails: * [email protected], ** [email protected]