#3749: [with patch; needs work] Request for a method "is_cyclic" for groups in
SAGE
--------------------------+-------------------------------------------------
Reporter: ljpk | Owner: joyner
Type: defect | Status: new
Priority: minor | Milestone: sage-3.2.2
Component: group_theory | Resolution:
Keywords: |
--------------------------+-------------------------------------------------
Comment (by was):
Robert Miller points that there is an easy algorithm for computing the
elementary divisors d1, d2, d3, of a finite abelian group, where
elementary divisors means d1 | d2 | d3 | ...
Just factor the numbers a_i that define the abelian group. Then the
biggest d_i is the product of the maximum prime powers dividing some a_j.
I.e., d_i is the product of p^v, where v = max(ord_p(a_j) for all j).
Then divide out all those p^v's, and repeat to compute d_{i-1}.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/3749#comment:8>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
