arXiv:1806.03774 [math.GR]AbstractReferencesReviewsResources
Counting subgroups of fixed order in finite abelian groups
Published 2018-06-11Version 1
We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we answer some questions by M. T$\ddot{a}$rn$\ddot{a}$uceanu in \cite{MT} and L. T$\dot{\acute{o}}$th in \cite{LT}. We also use other methods such as the method of fundamental group lattices introduced in \cite{MT} to derive a similar counting function in a special case of arbitrary rank finite abelian p-groups.
Comments: 18 pages. Comments welcome!
Related articles: Most relevant | Search more
arXiv:2401.11873 [math.GR] (Published 2024-01-22)
Some Properties of Proper Power Graphs in Finite Abelian Groups
arXiv:1309.0989 [math.GR] (Published 2013-09-03)
On schurity of finite abelian groups
Subgroups of finite Abelian groups having rank two via Goursat's lemma