English

Counting subgroups of fixed order in finite abelian groups

Group Theory 2018-06-18 v2 Combinatorics

Abstract

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. Ta¨\ddot{a}rna¨\ddot{a}uceanu in \cite{MT} and L. Toˊ˙\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.

Keywords

Cite

@article{arxiv.1806.03774,
  title  = {Counting subgroups of fixed order in finite abelian groups},
  author = {Fikreab Admasu and Amit Sehgal},
  journal= {arXiv preprint arXiv:1806.03774},
  year   = {2018}
}

Comments

18 pages. Comments welcome!