EN
SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS
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.
Keywords
References
- 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.
- 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). 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.
- A. Harmancı, D. Keskin and P.F. Smith, On ⊕-supplemented modules, Acta Math. Hungar., 83 (1999), 161–169.
- D. Keskin and W. Xue, Generalizations of lifting modules, Acta Math. Hun- gar., 91 (2001), 253–261.
- 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, Cambridge, P.F. Smith and A. Tercan, Generalizations of CS modules, Comm. Algebra, (1993), 1809–1847.
- 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
Details
Primary Language
English
Subjects
-
Journal Section
-
Publication Date
December 1, 2007
Submission Date
December 1, 2007
Acceptance Date
-
Published in Issue
Year 2007 Volume: 2 Number: 2
APA
Crivei, S., & Szöllosi, Ş. Ş. (2007). SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. International Electronic Journal of Algebra, 2(2), 54-70. https://izlik.org/JA93MX77YY
AMA
1.Crivei S, Szöllosi ŞŞ. SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. IEJA. 2007;2(2):54-70. https://izlik.org/JA93MX77YY
Chicago
Crivei, Septimiu, and Ştefan Şuteu Szöllosi. 2007. “SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS”. International Electronic Journal of Algebra 2 (2): 54-70. https://izlik.org/JA93MX77YY.
EndNote
Crivei S, Szöllosi ŞŞ (December 1, 2007) SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. International Electronic Journal of Algebra 2 2 54–70.
IEEE
[1]S. Crivei and Ş. Ş. Szöllosi, “SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS”, IEJA, vol. 2, no. 2, pp. 54–70, Dec. 2007, [Online]. Available: https://izlik.org/JA93MX77YY
ISNAD
Crivei, Septimiu - Szöllosi, Ştefan Şuteu. “SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS”. International Electronic Journal of Algebra 2/2 (December 1, 2007): 54-70. https://izlik.org/JA93MX77YY.
JAMA
1.Crivei S, Szöllosi ŞŞ. SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. IEJA. 2007;2:54–70.
MLA
Crivei, Septimiu, and Ştefan Şuteu Szöllosi. “SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS”. International Electronic Journal of Algebra, vol. 2, no. 2, Dec. 2007, pp. 54-70, https://izlik.org/JA93MX77YY.
Vancouver
1.Septimiu Crivei, Ştefan Şuteu Szöllosi. SUBGROUP LATTICE ALGORITHMS RELATED TO EXTENDING AND LIFTING ABELIAN GROUPS. IEJA [Internet]. 2007 Dec. 1;2(2):54-70. Available from: https://izlik.org/JA93MX77YY