# HG changeset patch
# User Nicolas Borie <nicolas.borie at math.u-psud.fr>
# Date 1271664282 -7200
# Node ID 3086c5a74b683730e92330aa5bf1d5d8573c7c09
# Parent 8e9e6b0d869e12391482391b94877307fcb73f22
#8500: Add the set of TransitiveGroups; final patch
diff -r 8e9e6b0d869e -r 3086c5a74b68 sage/groups/perm_gps/permgroup_named.py
a
|
b
|
|
908 | 908 | d = ZZ(d) |
909 | 909 | n = ZZ(n) |
910 | 910 | assert d >= 0 |
911 | | assert n > 0 |
912 | 911 | max_n = TransitiveGroups(d).cardinality() |
913 | 912 | assert n <= max_n, "n should be in {1,..,%s}"%max_n |
| 913 | assert n > 0, "n should be in {1,..,%s}"%max_n |
914 | 914 | gap_group = 'Group([()])' if d in [0,1] else 'TransitiveGroup(%s,%s)'%(d,n) |
915 | 915 | try: |
916 | 916 | PermutationGroup_generic.__init__(self, gap_group=gap_group) |
… |
… |
|
972 | 972 | |
973 | 973 | class TransitiveGroupsAll(DisjointUnionEnumeratedSets): |
974 | 974 | """ |
975 | | The finite set of all transitive groups. |
| 975 | The infinite set of all transitive groups. |
976 | 976 | |
977 | 977 | EXAMPLES:: |
978 | 978 | |
… |
… |
|
1119 | 1119 | sage: TransitiveGroups(5)[0] |
1120 | 1120 | Traceback (most recent call last): |
1121 | 1121 | ... |
1122 | | assert n > 0 |
1123 | | AssertionError |
| 1122 | AssertionError: n should be in {1,..,5} |
1124 | 1123 | """ |
1125 | 1124 | return TransitiveGroup(self._degree, n) |
1126 | 1125 | |