[Bug 1765730] New: Review Request: gap-pkg-grpconst - Constructing groups of a given order

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



https://bugzilla.redhat.com/show_bug.cgi?id=1765730

            Bug ID: 1765730
           Summary: Review Request: gap-pkg-grpconst - Constructing groups
                    of a given order
           Product: Fedora
           Version: rawhide
          Hardware: All
                OS: Linux
            Status: NEW
         Component: Package Review
          Severity: medium
          Priority: medium
          Assignee: nobody@xxxxxxxxxxxxxxxxx
          Reporter: loganjerry@xxxxxxxxx
        QA Contact: extras-qa@xxxxxxxxxxxxxxxxx
                CC: package-review@xxxxxxxxxxxxxxxxxxxxxxx
  Target Milestone: ---
    Classification: Fedora



Spec URL:
https://jjames.fedorapeople.org/gap-pkg-grpconst/gap-pkg-grpconst.spec
SRPM URL:
https://jjames.fedorapeople.org/gap-pkg-grpconst/gap-pkg-grpconst-2.6.1-1.fc32.src.rpm
RPMLINTRC URL:
https://jjames.fedorapeople.org/gap-pkg-grpconst/gap-pkg-grpconst.rpmlintrc
Fedora Account System Username: jjames
Description: This package contains GAP implementations of three different
approaches to constructing up to isomorphism all groups of a given order.

The FrattiniExtensionMethod constructs all soluble groups of a given order.  On
request it gives only those that are (or are not) nilpotent or supersolvable or
that do (or do not) have normal Sylow subgroups for some given set of primes. 
The program's output may be expressed in a compact coded form, if desired.

The CyclicSplitExtensionMethod constructs all (necessarily soluble) groups
whose given orders are of the form p^n*q for different primes p and q and which
have at least one normal Sylow subgroup.  The method, which relies upon having
available a list of all groups of order p^n, is often faster than the Frattini
extension method for the groups to which it applies.

The UpwardsExtensions method takes as its input a permutation group G and
positive integer s and returns a list of permutation groups, one for each
extension of G by a soluble group of order a divisor of s.  Usually it is used
for nonsoluble G only, since for soluble groups the above methods are more
efficient.

-- 
You are receiving this mail because:
You are on the CC list for the bug.
You are always notified about changes to this product and component
_______________________________________________
package-review mailing list -- package-review@xxxxxxxxxxxxxxxxxxxxxxx
To unsubscribe send an email to package-review-leave@xxxxxxxxxxxxxxxxxxxxxxx
Fedora Code of Conduct: https://docs.fedoraproject.org/en-US/project/code-of-conduct/
List Guidelines: https://fedoraproject.org/wiki/Mailing_list_guidelines
List Archives: https://lists.fedoraproject.org/archives/list/package-review@xxxxxxxxxxxxxxxxxxxxxxx




[Index of Archives]     [Fedora Users]     [Fedora Desktop]     [Fedora SELinux]     [Yosemite Conditions]     [KDE Users]

  Powered by Linux