Revision history [back]

I'm looking for a Sagemath builtin function giving the list of all the possible invariant factors of an abelian group with given finite order (say n)?

[In Sagemath terminology, invariant factor is known as [elementary divisor](https://doc.sagemath.org/html/en/reference/groups/sage/groups/abelian_gps/abelian_group_gap.html#sage.groups.abelian_gps.abelian_group_gap.AbelianGroup_gap.elementary_divisors)]

For instance, if n = 48, it should return something like this:

[[2, 2, 2, 6], [2, 2, 12], [2, 24], [4, 12], [48]]

Or perhaps the list of all the possible elementary divisors in the proper sense.

This is not group theory but more or less combinatorics or counting.

I'm looking for a Sagemath builtin function giving the list of all the possible invariant factors of an abelian group with given finite order (say n)?

[In In Sagemath terminology, invariant factor is known as [elementary divisor](https://doc.sagemath.org/html/en/reference/groups/sage/groups/abelian_gps/abelian_group_gap.html#sage.groups.abelian_gps.abelian_group_gap.AbelianGroup_gap.elementary_divisors)]elementary divisor

For instance, if n = 48, it should return something like this:

[[2, 2, 2, 6], [2, 2, 12], [2, 24], [4, 12], [48]]

Or perhaps the list of all the possible elementary divisors in the proper sense.

This is not group theory but more or less combinatorics or counting.