regina 7.3.1.1__cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Potentially problematic release.
This version of regina might be problematic. Click here for more details.
- regina/__init__.py +203 -0
- regina/engine.cpython-313-x86_64-linux-gnu.so +0 -0
- regina/plainCompleter.py +221 -0
- regina/pyCensus/__init__.py +14 -0
- regina/pyCensus/christy-knots-links.tdb +0 -0
- regina/pyCensus/closed-hyp-census-full.tdb +0 -0
- regina/pyCensus/closed-nor-census-11.tdb +0 -0
- regina/pyCensus/closed-or-census-11.tdb +0 -0
- regina/pyCensus/cusped-hyp-nor-census-9.tdb +0 -0
- regina/pyCensus/cusped-hyp-or-census-9.tdb +0 -0
- regina/sageRegina/__init__.py +2 -0
- regina/sageRegina/config.py +9 -0
- regina/sageRegina/test.py +132 -0
- regina/sageRegina/testsuite/CMakeLists.txt +60 -0
- regina/sageRegina/testsuite/O2_1.rga +15 -0
- regina/sageRegina/testsuite/O2_1.tri +28 -0
- regina/sageRegina/testsuite/README.txt +20 -0
- regina/sageRegina/testsuite/alltypes.out +1551 -0
- regina/sageRegina/testsuite/alltypes.test +88 -0
- regina/sageRegina/testsuite/angles.out +102 -0
- regina/sageRegina/testsuite/angles.test +72 -0
- regina/sageRegina/testsuite/basic_callback.out +124 -0
- regina/sageRegina/testsuite/basic_sub.out +7 -0
- regina/sageRegina/testsuite/bool.out +6 -0
- regina/sageRegina/testsuite/bool.test +64 -0
- regina/sageRegina/testsuite/bytes.out +17 -0
- regina/sageRegina/testsuite/bytes.test +78 -0
- regina/sageRegina/testsuite/callbacks.out +515 -0
- regina/sageRegina/testsuite/callbacks.test +281 -0
- regina/sageRegina/testsuite/census.out +120 -0
- regina/sageRegina/testsuite/census.test +157 -0
- regina/sageRegina/testsuite/clone.out +18 -0
- regina/sageRegina/testsuite/clone.test +101 -0
- regina/sageRegina/testsuite/constructors.out +14 -0
- regina/sageRegina/testsuite/constructors.test +97 -0
- regina/sageRegina/testsuite/cube.orb +87 -0
- regina/sageRegina/testsuite/discs.out +3 -0
- regina/sageRegina/testsuite/discs.test +40 -0
- regina/sageRegina/testsuite/docstrings.filter +19 -0
- regina/sageRegina/testsuite/docstrings.out +808 -0
- regina/sageRegina/testsuite/docstrings.out.v2 +808 -0
- regina/sageRegina/testsuite/docstrings.test +57 -0
- regina/sageRegina/testsuite/dodec.orb +309 -0
- regina/sageRegina/testsuite/embeddings.out +23 -0
- regina/sageRegina/testsuite/embeddings.test +89 -0
- regina/sageRegina/testsuite/enumerate.out +62 -0
- regina/sageRegina/testsuite/enumerate.test +82 -0
- regina/sageRegina/testsuite/equality.out +112 -0
- regina/sageRegina/testsuite/equality.test +310 -0
- regina/sageRegina/testsuite/euler.out +15 -0
- regina/sageRegina/testsuite/euler.test +95 -0
- regina/sageRegina/testsuite/exception.out +7 -0
- regina/sageRegina/testsuite/exception.test +100 -0
- regina/sageRegina/testsuite/facenumbering.out +546 -0
- regina/sageRegina/testsuite/facenumbering.test +74 -0
- regina/sageRegina/testsuite/faces.out +40 -0
- regina/sageRegina/testsuite/faces.test +72 -0
- regina/sageRegina/testsuite/file.out +1229 -0
- regina/sageRegina/testsuite/file.test +70 -0
- regina/sageRegina/testsuite/file1.rga +0 -0
- regina/sageRegina/testsuite/file2.rga +0 -0
- regina/sageRegina/testsuite/file3.rga +119 -0
- regina/sageRegina/testsuite/flype.out +37 -0
- regina/sageRegina/testsuite/flype.test +50 -0
- regina/sageRegina/testsuite/generic.out +116 -0
- regina/sageRegina/testsuite/generic.test +76 -0
- regina/sageRegina/testsuite/groups.out +70 -0
- regina/sageRegina/testsuite/groups.test +117 -0
- regina/sageRegina/testsuite/hypersurfaces.out +681 -0
- regina/sageRegina/testsuite/hypersurfaces.test +90 -0
- regina/sageRegina/testsuite/i18n-latin1.rga +8 -0
- regina/sageRegina/testsuite/i18n-utf8.rga +8 -0
- regina/sageRegina/testsuite/i18n.out +6 -0
- regina/sageRegina/testsuite/i18n.test +91 -0
- regina/sageRegina/testsuite/id.out +2 -0
- regina/sageRegina/testsuite/id.test +47 -0
- regina/sageRegina/testsuite/index.out +2 -0
- regina/sageRegina/testsuite/index.test +43 -0
- regina/sageRegina/testsuite/integer.out +74 -0
- regina/sageRegina/testsuite/integer.test +56 -0
- regina/sageRegina/testsuite/italian.orb +90 -0
- regina/sageRegina/testsuite/iterators.out +118 -0
- regina/sageRegina/testsuite/iterators.test +128 -0
- regina/sageRegina/testsuite/knotted-Y.orb +47 -0
- regina/sageRegina/testsuite/listener.out +43 -0
- regina/sageRegina/testsuite/listener.test +101 -0
- regina/sageRegina/testsuite/listview.out +416 -0
- regina/sageRegina/testsuite/listview.test +253 -0
- regina/sageRegina/testsuite/lookup.out +13 -0
- regina/sageRegina/testsuite/lookup.test +44 -0
- regina/sageRegina/testsuite/memory1.out +62 -0
- regina/sageRegina/testsuite/memory1.test +154 -0
- regina/sageRegina/testsuite/memory2.out +62 -0
- regina/sageRegina/testsuite/memory2.test +124 -0
- regina/sageRegina/testsuite/memory3.out +92 -0
- regina/sageRegina/testsuite/memory3.test +216 -0
- regina/sageRegina/testsuite/misc.out +7 -0
- regina/sageRegina/testsuite/misc.test +56 -0
- regina/sageRegina/testsuite/operators.out +129 -0
- regina/sageRegina/testsuite/operators.test +61 -0
- regina/sageRegina/testsuite/orb.out +441 -0
- regina/sageRegina/testsuite/orb.test +49 -0
- regina/sageRegina/testsuite/pdf.out +4 -0
- regina/sageRegina/testsuite/pdf.test +49 -0
- regina/sageRegina/testsuite/perm.out +55 -0
- regina/sageRegina/testsuite/perm.test +96 -0
- regina/sageRegina/testsuite/plantri.out +12 -0
- regina/sageRegina/testsuite/plantri.test +60 -0
- regina/sageRegina/testsuite/presentations.out +11 -0
- regina/sageRegina/testsuite/presentations.test +61 -0
- regina/sageRegina/testsuite/refs.out +51 -0
- regina/sageRegina/testsuite/refs.test +128 -0
- regina/sageRegina/testsuite/repr.out +951 -0
- regina/sageRegina/testsuite/repr.out.v2 +951 -0
- regina/sageRegina/testsuite/repr.test +548 -0
- regina/sageRegina/testsuite/safeheldtype_basic.out +17 -0
- regina/sageRegina/testsuite/safeheldtype_basic.test +113 -0
- regina/sageRegina/testsuite/safeheldtype_packet.out +58 -0
- regina/sageRegina/testsuite/safeheldtype_packet.test +181 -0
- regina/sageRegina/testsuite/sample.pdf +0 -0
- regina/sageRegina/testsuite/sets.out +7 -0
- regina/sageRegina/testsuite/sets.test +44 -0
- regina/sageRegina/testsuite/skeleton.out +308 -0
- regina/sageRegina/testsuite/skeleton.test +54 -0
- regina/sageRegina/testsuite/snappea.out +82 -0
- regina/sageRegina/testsuite/snappea.test +107 -0
- regina/sageRegina/testsuite/snapshot.out +15 -0
- regina/sageRegina/testsuite/snapshot.test +78 -0
- regina/sageRegina/testsuite/sort.out +57 -0
- regina/sageRegina/testsuite/sort.test +53 -0
- regina/sageRegina/testsuite/special.out +4 -0
- regina/sageRegina/testsuite/special.test +47 -0
- regina/sageRegina/testsuite/standardtri.out +12101 -0
- regina/sageRegina/testsuite/standardtri.test +455 -0
- regina/sageRegina/testsuite/surfaces.out +2133 -0
- regina/sageRegina/testsuite/surfaces.test +114 -0
- regina/sageRegina/testsuite/swapping.out +25 -0
- regina/sageRegina/testsuite/swapping.test +88 -0
- regina/sageRegina/testsuite/testall.in +176 -0
- regina/sageRegina/testsuite/testbasic.in +279 -0
- regina/sageRegina/testsuite/testcallback.in +150 -0
- regina/sageRegina/testsuite/testsub.in +150 -0
- regina/sageRegina/testsuite/theta_in_solid_torus.orb +65 -0
- regina/sageRegina/testsuite/tightencode.out +40 -0
- regina/sageRegina/testsuite/tightencode.test +108 -0
- regina/sageRegina/testsuite/treedecomp.out +135 -0
- regina/sageRegina/testsuite/treedecomp.test +66 -0
- regina/sageRegina/testsuite/treetraversal.out +52 -0
- regina/sageRegina/testsuite/treetraversal.test +190 -0
- regina/sageRegina/testsuite/trigeneral.out +1251 -0
- regina/sageRegina/testsuite/trigeneral.test +155 -0
- regina/sageRegina/testsuite/utf8.out +42 -0
- regina/sageRegina/testsuite/utf8.test +94 -0
- regina/sageRegina/version.py +5 -0
- regina/sageSetup.py +41 -0
- regina/test.py +6 -0
- regina-7.3.1.1.dist-info/METADATA +109 -0
- regina-7.3.1.1.dist-info/RECORD +163 -0
- regina-7.3.1.1.dist-info/WHEEL +6 -0
- regina-7.3.1.1.dist-info/top_level.txt +4 -0
- regina.libs/libbz2-a273e504.so.1.0.6 +0 -0
- regina.libs/libgmp-afec2dd4.so.10.2.0 +0 -0
- regina.libs/libgmpxx-25f6cf8d.so.4.4.0 +0 -0
|
@@ -0,0 +1,70 @@
|
|
|
1
|
+
# Regina - A Normal Surface Theory Calculator
|
|
2
|
+
# Python Test Suite Component
|
|
3
|
+
#
|
|
4
|
+
# Copyright (c) 2011-2023, Ben Burton
|
|
5
|
+
# For further details contact Ben Burton (bab@debian.org).
|
|
6
|
+
#
|
|
7
|
+
# Tests support for the modern XML file format
|
|
8
|
+
#
|
|
9
|
+
# This file is a single component of Regina's python test suite. To run
|
|
10
|
+
# the python test suite, move to the main python directory in the source
|
|
11
|
+
# tree and run "make check".
|
|
12
|
+
#
|
|
13
|
+
# This program is free software; you can redistribute it and/or
|
|
14
|
+
# modify it under the terms of the GNU General Public License as
|
|
15
|
+
# published by the Free Software Foundation; either version 2 of the
|
|
16
|
+
# License, or (at your option) any later version.
|
|
17
|
+
#
|
|
18
|
+
# As an exception, when this program is distributed through (i) the
|
|
19
|
+
# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
|
|
20
|
+
# (iii) Google Play by Google Inc., then that store may impose any
|
|
21
|
+
# digital rights management, device limits and/or redistribution
|
|
22
|
+
# restrictions that are required by its terms of service.
|
|
23
|
+
#
|
|
24
|
+
# This program is distributed in the hope that it will be useful, but
|
|
25
|
+
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
26
|
+
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
27
|
+
# General Public License for more details.
|
|
28
|
+
#
|
|
29
|
+
# You should have received a copy of the GNU General Public
|
|
30
|
+
# License along with this program; if not, write to the Free
|
|
31
|
+
# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
|
|
32
|
+
# MA 02110-1301, USA.
|
|
33
|
+
|
|
34
|
+
# Fetch the python/testsuite path in the source tree, since we will need
|
|
35
|
+
# to access external files.
|
|
36
|
+
import sys
|
|
37
|
+
if (len(sys.argv) > 1):
|
|
38
|
+
testpath = sys.argv[1]
|
|
39
|
+
else:
|
|
40
|
+
testpath = '.'
|
|
41
|
+
|
|
42
|
+
# A routine that performs essentially the same tasks as regfiledump.
|
|
43
|
+
def dump(tree):
|
|
44
|
+
if tree == None:
|
|
45
|
+
print('ERROR: Null packet tree.')
|
|
46
|
+
return
|
|
47
|
+
|
|
48
|
+
p = tree
|
|
49
|
+
while p != None:
|
|
50
|
+
print('************************************************************')
|
|
51
|
+
print('*')
|
|
52
|
+
print('* Label: ' + p.label())
|
|
53
|
+
print('* Type: ' + p.typeName())
|
|
54
|
+
if p.parent() == None:
|
|
55
|
+
print('* Parent: (none)')
|
|
56
|
+
else:
|
|
57
|
+
print('* Parent: ' + p.parent().label())
|
|
58
|
+
print('*')
|
|
59
|
+
print('************************************************************')
|
|
60
|
+
print()
|
|
61
|
+
print(p.detail())
|
|
62
|
+
print()
|
|
63
|
+
|
|
64
|
+
p = p.nextTreePacket()
|
|
65
|
+
|
|
66
|
+
# Load and dump some files created by different versions of regina.
|
|
67
|
+
dump(regina.open(testpath + '/file1.rga'))
|
|
68
|
+
dump(regina.open(testpath + '/file2.rga'))
|
|
69
|
+
dump(regina.open(testpath + '/file3.rga'))
|
|
70
|
+
|
|
Binary file
|
|
Binary file
|
|
@@ -0,0 +1,119 @@
|
|
|
1
|
+
<?xml version="1.0"?>
|
|
2
|
+
<reginadata engine="5.0">
|
|
3
|
+
<packet label="Root"
|
|
4
|
+
type="Container" typeid="1"
|
|
5
|
+
parent="">
|
|
6
|
+
<packet label="2-D"
|
|
7
|
+
type="2-Manifold Triangulation" typeid="15"
|
|
8
|
+
parent="Root">
|
|
9
|
+
<triangles ntriangles="2">
|
|
10
|
+
<triangle desc=""> 1 4 -1 -1 1 2 </triangle>
|
|
11
|
+
<triangle desc=""> 0 4 -1 -1 0 2 </triangle>
|
|
12
|
+
</triangles>
|
|
13
|
+
</packet> <!-- 2_D (2_Manifold Triangulation) -->
|
|
14
|
+
<packet label="3-D"
|
|
15
|
+
type="3-Manifold Triangulation" typeid="3"
|
|
16
|
+
parent="Root">
|
|
17
|
+
<tetrahedra ntet="2">
|
|
18
|
+
<tet desc=""> 1 147 -1 -1 -1 -1 1 57 </tet>
|
|
19
|
+
<tet desc=""> 0 147 -1 -1 -1 -1 0 57 </tet>
|
|
20
|
+
</tetrahedra>
|
|
21
|
+
</packet> <!-- 3_D (3_Manifold Triangulation) -->
|
|
22
|
+
<packet label="4-D"
|
|
23
|
+
type="4-Manifold Triangulation" typeid="11"
|
|
24
|
+
parent="Root">
|
|
25
|
+
<pentachora npent="2">
|
|
26
|
+
<pent desc=""> 1 13380 -1 -1 -1 -1 -1 -1 1 2257 </pent>
|
|
27
|
+
<pent desc=""> 0 13380 -1 -1 -1 -1 -1 -1 0 2257 </pent>
|
|
28
|
+
</pentachora>
|
|
29
|
+
</packet> <!-- 4_D (4_Manifold Triangulation) -->
|
|
30
|
+
<packet label="5-D"
|
|
31
|
+
type="5-Manifold Triangulation" typeid="105"
|
|
32
|
+
parent="Root">
|
|
33
|
+
<simplices size="2">
|
|
34
|
+
<simplex desc=""> 1 144453 -1 -1 -1 -1 -1 -1 -1 -1 1 22737 </simplex>
|
|
35
|
+
<simplex desc=""> 0 144453 -1 -1 -1 -1 -1 -1 -1 -1 0 22737 </simplex>
|
|
36
|
+
</simplices>
|
|
37
|
+
</packet> <!-- 5_D (5_Manifold Triangulation) -->
|
|
38
|
+
<packet label="6-D"
|
|
39
|
+
type="6-Manifold Triangulation" typeid="106"
|
|
40
|
+
parent="Root">
|
|
41
|
+
<simplices size="2">
|
|
42
|
+
<simplex desc=""> 1 1455174 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 219345 </simplex>
|
|
43
|
+
<simplex desc=""> 0 1455174 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 219345 </simplex>
|
|
44
|
+
</simplices>
|
|
45
|
+
</packet> <!-- 6_D (6_Manifold Triangulation) -->
|
|
46
|
+
<packet label="7-D"
|
|
47
|
+
type="7-Manifold Triangulation" typeid="107"
|
|
48
|
+
parent="Root">
|
|
49
|
+
<simplices size="2">
|
|
50
|
+
<simplex desc=""> 1 14038087 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 2054353 </simplex>
|
|
51
|
+
<simplex desc=""> 0 14038087 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 2054353 </simplex>
|
|
52
|
+
</simplices>
|
|
53
|
+
</packet> <!-- 7_D (7_Manifold Triangulation) -->
|
|
54
|
+
<packet label="8-D"
|
|
55
|
+
type="8-Manifold Triangulation" typeid="108"
|
|
56
|
+
parent="Root">
|
|
57
|
+
<simplices size="2">
|
|
58
|
+
<simplex desc=""> 1 31763669256 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 2271560481 </simplex>
|
|
59
|
+
<simplex desc=""> 0 31763669256 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 2271560481 </simplex>
|
|
60
|
+
</simplices>
|
|
61
|
+
</packet> <!-- 8_D (8_Manifold Triangulation) -->
|
|
62
|
+
<packet label="9-D"
|
|
63
|
+
type="9-Manifold Triangulation" typeid="109"
|
|
64
|
+
parent="Root">
|
|
65
|
+
<simplices size="2">
|
|
66
|
+
<simplex desc=""> 1 581519483145 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 40926266145 </simplex>
|
|
67
|
+
<simplex desc=""> 0 581519483145 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 40926266145 </simplex>
|
|
68
|
+
</simplices>
|
|
69
|
+
</packet> <!-- 9_D (9_Manifold Triangulation) -->
|
|
70
|
+
<packet label="10-D"
|
|
71
|
+
type="10-Manifold Triangulation" typeid="110"
|
|
72
|
+
parent="Root">
|
|
73
|
+
<simplices size="2">
|
|
74
|
+
<simplex desc=""> 1 10477124133130 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 728121033505 </simplex>
|
|
75
|
+
<simplex desc=""> 0 10477124133130 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 728121033505 </simplex>
|
|
76
|
+
</simplices>
|
|
77
|
+
</packet> <!-- 10_D (10_Manifold Triangulation) -->
|
|
78
|
+
<packet label="11-D"
|
|
79
|
+
type="11-Manifold Triangulation" typeid="111"
|
|
80
|
+
parent="Root">
|
|
81
|
+
<simplices size="2">
|
|
82
|
+
<simplex desc=""> 1 186398984577291 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 12822748939041 </simplex>
|
|
83
|
+
<simplex desc=""> 0 186398984577291 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 12822748939041 </simplex>
|
|
84
|
+
</simplices>
|
|
85
|
+
</packet> <!-- 11_D (11_Manifold Triangulation) -->
|
|
86
|
+
<packet label="12-D"
|
|
87
|
+
type="12-Manifold Triangulation" typeid="112"
|
|
88
|
+
parent="Root">
|
|
89
|
+
<simplices size="2">
|
|
90
|
+
<simplex desc=""> 1 3282623728394508 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 223928981472033 </simplex>
|
|
91
|
+
<simplex desc=""> 0 3282623728394508 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 223928981472033 </simplex>
|
|
92
|
+
</simplices>
|
|
93
|
+
</packet> <!-- 12_D (12_Manifold Triangulation) -->
|
|
94
|
+
<packet label="13-D"
|
|
95
|
+
type="13-Manifold Triangulation" typeid="113"
|
|
96
|
+
parent="Root">
|
|
97
|
+
<simplices size="2">
|
|
98
|
+
<simplex desc=""> 1 57325819256840461 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 3883103678710561 </simplex>
|
|
99
|
+
<simplex desc=""> 0 57325819256840461 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 3883103678710561 </simplex>
|
|
100
|
+
</simplices>
|
|
101
|
+
</packet> <!-- 13_D (13_Manifold Triangulation) -->
|
|
102
|
+
<packet label="14-D"
|
|
103
|
+
type="14-Manifold Triangulation" typeid="114"
|
|
104
|
+
parent="Root">
|
|
105
|
+
<simplices size="2">
|
|
106
|
+
<simplex desc=""> 1 994074541749903630 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 66933498461897505 </simplex>
|
|
107
|
+
<simplex desc=""> 0 994074541749903630 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 66933498461897505 </simplex>
|
|
108
|
+
</simplices>
|
|
109
|
+
</packet> <!-- 14_D (14_Manifold Triangulation) -->
|
|
110
|
+
<packet label="15-D"
|
|
111
|
+
type="15-Manifold Triangulation" typeid="115"
|
|
112
|
+
parent="Root">
|
|
113
|
+
<simplices size="2">
|
|
114
|
+
<simplex desc=""> 1 17134975606245761295 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1147797409030816545 </simplex>
|
|
115
|
+
<simplex desc=""> 0 17134975606245761295 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 1147797409030816545 </simplex>
|
|
116
|
+
</simplices>
|
|
117
|
+
</packet> <!-- 15_D (15_Manifold Triangulation) -->
|
|
118
|
+
</packet> <!-- Root (Container) -->
|
|
119
|
+
</reginadata>
|
|
@@ -0,0 +1,37 @@
|
|
|
1
|
+
0 0 cdbb,dcaa,ddab,ccba
|
|
2
|
+
0 2 bbdc,daac,dbad,cabc
|
|
3
|
+
1 0 cdbb,dcaa,ddab,ccba
|
|
4
|
+
1 2 cbbd,aacd,dbad,cabc
|
|
5
|
+
2 1 bcdb,adca,abdd,accb
|
|
6
|
+
2 3 bbdc,aacd,ddba,abcc
|
|
7
|
+
3 1 bcdb,adca,bdda,bacc
|
|
8
|
+
3 3 bbdc,aacd,badd,ccab
|
|
9
|
+
|
|
10
|
+
0 0 cebb,aaed,dead,cbec,bacd
|
|
11
|
+
0 2 bbec,adea,ddae,cceb,bdca
|
|
12
|
+
1 0 cbbe,aade,ddae,cceb,bdca
|
|
13
|
+
1 2 cebb,edaa,dead,cbec,bacd
|
|
14
|
+
2 0 becb,eaad,aedd,ebcc,abdc
|
|
15
|
+
2 2 bbce,edaa,ddea,eccb,acdb
|
|
16
|
+
3 0 becb,eaad,aedd,ebcc,abdc
|
|
17
|
+
3 2 bbce,edaa,adde,ccbe,acdb
|
|
18
|
+
4 1 bbec,deaa,daed,cebc,dcab
|
|
19
|
+
4 3 bceb,daae,ddea,ccbe,bacd
|
|
20
|
+
|
|
21
|
+
3 0 bxVh,cpag,epbf,fHee,ocdd,Mdcg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpen,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmnd,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQVE,UTON,UQPS,VVTS,aRUU
|
|
22
|
+
3 2 bhVx,cgap,efbp,eeHf,oddc,Mgcd,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wnep,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Mdnm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IEVQ,UNOT,USPQ,VSTV,aUUR
|
|
23
|
+
4 0 bxVh,cpag,epbf,fHee,ocdd,Mdcg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpen,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmnd,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQVE,UTON,UQPS,VVTS,aRUU
|
|
24
|
+
4 2 bhVx,cgap,efbp,feeH,ddco,Mgcd,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wnep,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Mdnm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IEVQ,UNOT,USPQ,VSTV,aUUR
|
|
25
|
+
29 1 bhVx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paEw,Nrsz,ANyt,BGzu,CGAv,FBwE,EERF,DDCx,GCDI,ABFL,Menm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IDVQ,UNOT,USPQ,VSTV,aUUR
|
|
26
|
+
29 3 bxVh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwEa,Nzsr,AtyN,BuzG,CvAG,FEwB,FREE,DxCD,GIDC,ALFB,Mmne,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQVD,UTON,UQPS,VVTS,aRUU
|
|
27
|
+
30 1 bhVx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paEw,Nrsz,ANyt,BGzu,CGAv,FBwE,EERF,DDCx,GCDI,ABFL,Menm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IDVQ,UNOT,USPQ,VSTV,aUUR
|
|
28
|
+
30 3 bxVh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwEa,Nzsr,AtyN,BuzG,CvAG,FEwB,EFRE,xCDD,GIDC,ALFB,Mmne,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQVD,UTON,UQPS,VVTS,aRUU
|
|
29
|
+
35 1 bxVh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmne,LKRF,LPKK,JQIJ,GOJI,klHf,SOzy,PLNS,QJOT,KPTR,IQVE,UTON,UQPS,VVTS,aRUU
|
|
30
|
+
35 3 bhVx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Menm,LFRK,KKPL,JJIQ,GIJO,kfHl,SyzO,PSNL,QTOJ,KRTP,IEVQ,UNOT,USPQ,VSTV,aUUR
|
|
31
|
+
36 1 bhVx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Menm,LFRK,PLKK,JJIQ,GIJO,kfHl,SyzO,PSNL,QTOJ,KRTP,IEVQ,UNOT,USPQ,VSTV,aUUR
|
|
32
|
+
36 3 bxVh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmne,LKRF,PKKL,QIJJ,GOJI,klHf,SOzy,PLNS,QJOT,KPTR,IQVE,UTON,UQPS,VVTS,aRUU
|
|
33
|
+
46 1 bxUh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmne,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQUE,VTON,VQPS,aRVV,UTSU
|
|
34
|
+
46 3 bhUx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Menm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IEUQ,VNOT,VSPQ,VVRa,UUST
|
|
35
|
+
47 1 bhUx,cgap,dfbp,eeco,ddHf,Mgce,qhbf,qiag,jrhq,kriq,sjMl,mtkM,nulH,ovmH,wndp,cbxo,jihg,syij,yrkt,uzsl,vAtm,wBun,Cvox,paDw,Nrsz,ANyt,BGzu,CGAv,FBwD,xEEC,FDDR,GCEI,ABFL,Menm,LFRJ,KIQK,LJJP,GIKO,kfHl,SyzO,PSNL,QTOK,JRTP,IEUQ,VNOT,VSPQ,RaVV,UUST
|
|
36
|
+
47 3 bxUh,cpag,dpbf,eoce,dfHd,Mecg,qfbh,qgai,jqhr,kqir,slMj,mMkt,nHlu,oHmv,wpdn,coxb,jghi,sjiy,ytkr,ulsz,vmtA,wnuB,Cxov,pwDa,Nzsr,AtyN,BuzG,CvAG,FDwB,xCEE,FRDD,GIEC,ALFB,Mmne,LJRF,KKQI,LPJJ,GOKI,klHf,SOzy,PLNS,QKOT,JPTR,IQUE,VTON,VQPS,RVVa,TSUU
|
|
37
|
+
|
|
@@ -0,0 +1,50 @@
|
|
|
1
|
+
# Regina - A Normal Surface Theory Calculator
|
|
2
|
+
# Python Test Suite Component
|
|
3
|
+
#
|
|
4
|
+
# Copyright (c) 2007-2023, Ben Burton
|
|
5
|
+
# For further details contact Ben Burton (bab@debian.org).
|
|
6
|
+
#
|
|
7
|
+
# Provides detailed tests for flypes on model link graphs.
|
|
8
|
+
#
|
|
9
|
+
# This file is a single component of Regina's python test suite. To run
|
|
10
|
+
# the python test suite, move to the main python directory in the source
|
|
11
|
+
# tree and run "make check".
|
|
12
|
+
#
|
|
13
|
+
# This program is free software; you can redistribute it and/or
|
|
14
|
+
# modify it under the terms of the GNU General Public License as
|
|
15
|
+
# published by the Free Software Foundation; either version 2 of the
|
|
16
|
+
# License, or (at your option) any later version.
|
|
17
|
+
#
|
|
18
|
+
# As an exception, when this program is distributed through (i) the
|
|
19
|
+
# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
|
|
20
|
+
# (iii) Google Play by Google Inc., then that store may impose any
|
|
21
|
+
# digital rights management, device limits and/or redistribution
|
|
22
|
+
# restrictions that are required by its terms of service.
|
|
23
|
+
#
|
|
24
|
+
# This program is distributed in the hope that it will be useful, but
|
|
25
|
+
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
26
|
+
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
27
|
+
# General Public License for more details.
|
|
28
|
+
#
|
|
29
|
+
# You should have received a copy of the GNU General Public
|
|
30
|
+
# License along with this program; if not, write to the Free
|
|
31
|
+
# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
|
|
32
|
+
# MA 02110-1301, USA.
|
|
33
|
+
|
|
34
|
+
def test(g):
|
|
35
|
+
for n in g.nodes():
|
|
36
|
+
for i in range(4):
|
|
37
|
+
start = n.arc(i)
|
|
38
|
+
args = g.findFlype(start)
|
|
39
|
+
if args[0]:
|
|
40
|
+
f = g.flype(start, args[0], args[1])
|
|
41
|
+
if (g.size() <= 52):
|
|
42
|
+
s = f.plantri()
|
|
43
|
+
else:
|
|
44
|
+
s = str(f)
|
|
45
|
+
print(n.index(), i, s)
|
|
46
|
+
print()
|
|
47
|
+
|
|
48
|
+
test(ExampleLink.figureEight().graph())
|
|
49
|
+
test(ExampleLink.whitehead().graph())
|
|
50
|
+
test(ExampleLink.gst().graph())
|
|
@@ -0,0 +1,116 @@
|
|
|
1
|
+
Triangulation: 5-D product #1
|
|
2
|
+
|
|
3
|
+
Connected: True
|
|
4
|
+
Orientable: True
|
|
5
|
+
Oriented: True
|
|
6
|
+
Boundary facets: 4
|
|
7
|
+
|
|
8
|
+
Bounded orientable 5-D triangulation, f = ( 1 5 10 10 5 1 )
|
|
9
|
+
|
|
10
|
+
Simplex | glued to: (01234) (01235) (01245) (01345) (02345) (12345)
|
|
11
|
+
---------+-----------------------------------------------------------------------------------
|
|
12
|
+
0 | 0 (12345) boundary boundary boundary boundary 0 (01234)
|
|
13
|
+
|
|
14
|
+
|
|
15
|
+
Triangulation: 5-D product #2
|
|
16
|
+
|
|
17
|
+
Connected: True
|
|
18
|
+
Orientable: True
|
|
19
|
+
Oriented: True
|
|
20
|
+
Boundary facets: 8
|
|
21
|
+
|
|
22
|
+
Bounded orientable 5-D triangulation, f = ( 2 10 20 20 10 2 )
|
|
23
|
+
|
|
24
|
+
Simplex | glued to: (01234) (01235) (01245) (01345) (02345) (12345)
|
|
25
|
+
---------+-----------------------------------------------------------------------------------
|
|
26
|
+
0 | 1 (12345) boundary boundary boundary boundary 1 (01234)
|
|
27
|
+
1 | 0 (12345) boundary boundary boundary boundary 0 (01234)
|
|
28
|
+
|
|
29
|
+
|
|
30
|
+
Triangulation: 6-D product #1
|
|
31
|
+
|
|
32
|
+
Connected: True
|
|
33
|
+
Orientable: False
|
|
34
|
+
Oriented: False
|
|
35
|
+
Boundary facets: 5
|
|
36
|
+
|
|
37
|
+
Bounded non-orientable 6-D triangulation, f = ( 1 6 15 20 15 6 1 )
|
|
38
|
+
|
|
39
|
+
Simplex | glued to: (012345) (012346) (012356) (012456) (013456) (023456) (123456)
|
|
40
|
+
---------+------------------------------------------------------------------------------------------------------
|
|
41
|
+
0 | 0 (123456) boundary boundary boundary boundary boundary 0 (012345)
|
|
42
|
+
|
|
43
|
+
|
|
44
|
+
Triangulation: 6-D product #2
|
|
45
|
+
|
|
46
|
+
Connected: True
|
|
47
|
+
Orientable: True
|
|
48
|
+
Oriented: True
|
|
49
|
+
Boundary facets: 10
|
|
50
|
+
|
|
51
|
+
Bounded orientable 6-D triangulation, f = ( 2 12 30 40 30 12 2 )
|
|
52
|
+
|
|
53
|
+
Simplex | glued to: (012345) (012346) (012356) (012456) (013456) (023456) (123456)
|
|
54
|
+
---------+------------------------------------------------------------------------------------------------------
|
|
55
|
+
0 | 1 (123456) boundary boundary boundary boundary boundary 1 (012345)
|
|
56
|
+
1 | 0 (123456) boundary boundary boundary boundary boundary 0 (012345)
|
|
57
|
+
|
|
58
|
+
|
|
59
|
+
Triangulation: 7-D product #1
|
|
60
|
+
|
|
61
|
+
Connected: True
|
|
62
|
+
Orientable: True
|
|
63
|
+
Oriented: True
|
|
64
|
+
Boundary facets: 6
|
|
65
|
+
|
|
66
|
+
Bounded orientable 7-D triangulation, f = ( 1 7 21 35 35 21 7 1 )
|
|
67
|
+
|
|
68
|
+
Simplex | glued to: (0123456) (0123457) (0123467) (0123567) (0124567) (0134567) (0234567) (1234567)
|
|
69
|
+
---------+---------------------------------------------------------------------------------------------------------------------------
|
|
70
|
+
0 | 0 (1234567) boundary boundary boundary boundary boundary boundary 0 (0123456)
|
|
71
|
+
|
|
72
|
+
|
|
73
|
+
Triangulation: 7-D product #2
|
|
74
|
+
|
|
75
|
+
Connected: True
|
|
76
|
+
Orientable: True
|
|
77
|
+
Oriented: True
|
|
78
|
+
Boundary facets: 12
|
|
79
|
+
|
|
80
|
+
Bounded orientable 7-D triangulation, f = ( 2 14 42 70 70 42 14 2 )
|
|
81
|
+
|
|
82
|
+
Simplex | glued to: (0123456) (0123457) (0123467) (0123567) (0124567) (0134567) (0234567) (1234567)
|
|
83
|
+
---------+---------------------------------------------------------------------------------------------------------------------------
|
|
84
|
+
0 | 1 (1234567) boundary boundary boundary boundary boundary boundary 1 (0123456)
|
|
85
|
+
1 | 0 (1234567) boundary boundary boundary boundary boundary boundary 0 (0123456)
|
|
86
|
+
|
|
87
|
+
|
|
88
|
+
Triangulation: 8-D product #1
|
|
89
|
+
|
|
90
|
+
Connected: True
|
|
91
|
+
Orientable: False
|
|
92
|
+
Oriented: False
|
|
93
|
+
Boundary facets: 7
|
|
94
|
+
|
|
95
|
+
Bounded non-orientable 8-D triangulation, f = ( 1 8 28 56 70 56 28 8 1 )
|
|
96
|
+
|
|
97
|
+
Simplex | glued to: (01234567) (01234568) (01234578) (01234678) (01235678) (01245678) (01345678) (02345678) (12345678)
|
|
98
|
+
---------+--------------------------------------------------------------------------------------------------------------------------------------------------
|
|
99
|
+
0 | 0 (12345678) boundary boundary boundary boundary boundary boundary boundary 0 (01234567)
|
|
100
|
+
|
|
101
|
+
|
|
102
|
+
Triangulation: 8-D product #2
|
|
103
|
+
|
|
104
|
+
Connected: True
|
|
105
|
+
Orientable: True
|
|
106
|
+
Oriented: True
|
|
107
|
+
Boundary facets: 14
|
|
108
|
+
|
|
109
|
+
Bounded orientable 8-D triangulation, f = ( 2 16 56 112 140 112 56 16 2 )
|
|
110
|
+
|
|
111
|
+
Simplex | glued to: (01234567) (01234568) (01234578) (01234678) (01235678) (01245678) (01345678) (02345678) (12345678)
|
|
112
|
+
---------+--------------------------------------------------------------------------------------------------------------------------------------------------
|
|
113
|
+
0 | 1 (12345678) boundary boundary boundary boundary boundary boundary boundary 1 (01234567)
|
|
114
|
+
1 | 0 (12345678) boundary boundary boundary boundary boundary boundary boundary 0 (01234567)
|
|
115
|
+
|
|
116
|
+
|
|
@@ -0,0 +1,76 @@
|
|
|
1
|
+
# Regina - A Normal Surface Theory Calculator
|
|
2
|
+
# Python Test Suite Component
|
|
3
|
+
#
|
|
4
|
+
# Copyright (c) 2015-2023, Ben Burton
|
|
5
|
+
# For further details contact Ben Burton (bab@debian.org).
|
|
6
|
+
#
|
|
7
|
+
# Provides tests for high-dimensional triangulations.
|
|
8
|
+
#
|
|
9
|
+
# This file is a single component of Regina's python test suite. To run
|
|
10
|
+
# the python test suite, move to the main python directory in the source
|
|
11
|
+
# tree and run "make check".
|
|
12
|
+
#
|
|
13
|
+
# This program is free software; you can redistribute it and/or
|
|
14
|
+
# modify it under the terms of the GNU General Public License as
|
|
15
|
+
# published by the Free Software Foundation; either version 2 of the
|
|
16
|
+
# License, or (at your option) any later version.
|
|
17
|
+
#
|
|
18
|
+
# As an exception, when this program is distributed through (i) the
|
|
19
|
+
# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
|
|
20
|
+
# (iii) Google Play by Google Inc., then that store may impose any
|
|
21
|
+
# digital rights management, device limits and/or redistribution
|
|
22
|
+
# restrictions that are required by its terms of service.
|
|
23
|
+
#
|
|
24
|
+
# This program is distributed in the hope that it will be useful, but
|
|
25
|
+
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
26
|
+
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
27
|
+
# General Public License for more details.
|
|
28
|
+
#
|
|
29
|
+
# You should have received a copy of the GNU General Public
|
|
30
|
+
# License along with this program; if not, write to the Free
|
|
31
|
+
# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
|
|
32
|
+
# MA 02110-1301, USA.
|
|
33
|
+
|
|
34
|
+
def product1(triClass, dim, permClass):
|
|
35
|
+
tri = triClass()
|
|
36
|
+
s = tri.newSimplex()
|
|
37
|
+
s.join(dim, s, permClass(list(range(1, dim+1)) + [0]))
|
|
38
|
+
return tri
|
|
39
|
+
|
|
40
|
+
def product2(triClass, dim, permClass):
|
|
41
|
+
tri = triClass()
|
|
42
|
+
s = tri.newSimplex()
|
|
43
|
+
t = tri.newSimplex()
|
|
44
|
+
s.join(dim, t, permClass(list(range(1, dim+1)) + [0]))
|
|
45
|
+
t.join(dim, s, permClass(list(range(1, dim+1)) + [0]))
|
|
46
|
+
return tri
|
|
47
|
+
|
|
48
|
+
def dump(tri, name):
|
|
49
|
+
print('Triangulation:', name)
|
|
50
|
+
print()
|
|
51
|
+
print('Connected:', tri.isConnected())
|
|
52
|
+
print('Orientable:', tri.isOrientable())
|
|
53
|
+
print('Oriented:', tri.isOrientable())
|
|
54
|
+
print('Boundary facets:', tri.countBoundaryFacets())
|
|
55
|
+
print()
|
|
56
|
+
print(tri.detail())
|
|
57
|
+
|
|
58
|
+
def testDim(triClass, dim, permClass):
|
|
59
|
+
dump(product1(triClass, dim, permClass), str(dim) + '-D product #1')
|
|
60
|
+
dump(product2(triClass, dim, permClass), str(dim) + '-D product #2')
|
|
61
|
+
|
|
62
|
+
#testDim(Triangulation2, 2, Perm3)
|
|
63
|
+
#testDim(Triangulation3, 3, Perm4)
|
|
64
|
+
#testDim(Triangulation4, 4, Perm5)
|
|
65
|
+
testDim(Triangulation5, 5, Perm6)
|
|
66
|
+
testDim(Triangulation6, 6, Perm7)
|
|
67
|
+
testDim(Triangulation7, 7, Perm8)
|
|
68
|
+
testDim(Triangulation8, 8, Perm9)
|
|
69
|
+
#testDim(Triangulation9, 9, Perm10)
|
|
70
|
+
#testDim(Triangulation10, 10, Perm11)
|
|
71
|
+
#testDim(Triangulation11, 11, Perm12)
|
|
72
|
+
#testDim(Triangulation12, 12, Perm13)
|
|
73
|
+
#testDim(Triangulation13, 13, Perm14)
|
|
74
|
+
#testDim(Triangulation14, 14, Perm15)
|
|
75
|
+
#testDim(Triangulation15, 15, Perm16)
|
|
76
|
+
|
|
@@ -0,0 +1,70 @@
|
|
|
1
|
+
------------------------
|
|
2
|
+
New marked abelian group
|
|
3
|
+
------------------------
|
|
4
|
+
|
|
5
|
+
Group: Z + Z_6 (Z^3 -> Z^5 -> Z^1)
|
|
6
|
+
Free generators:
|
|
7
|
+
0: ( -1 0 0 0 1 )
|
|
8
|
+
Torsion generators:
|
|
9
|
+
0: ( 3 -1 -1 0 -1 )
|
|
10
|
+
|
|
11
|
+
------------------------
|
|
12
|
+
New marked abelian group
|
|
13
|
+
------------------------
|
|
14
|
+
|
|
15
|
+
Group: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1)
|
|
16
|
+
Free generators:
|
|
17
|
+
0: ( -1 0 0 1 0 )
|
|
18
|
+
1: ( -1 0 0 0 1 )
|
|
19
|
+
Torsion generators:
|
|
20
|
+
0: ( -1 1 0 0 0 )
|
|
21
|
+
1: ( -3 0 1 1 1 )
|
|
22
|
+
|
|
23
|
+
----------------
|
|
24
|
+
New homomorphism
|
|
25
|
+
----------------
|
|
26
|
+
|
|
27
|
+
Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
|
|
28
|
+
Kernel: Z + Z_2
|
|
29
|
+
Cokernel: Z_5
|
|
30
|
+
Image: Z + Z_6
|
|
31
|
+
Reduced Matrix (torsion coordinates appear first):
|
|
32
|
+
0 3 0 2
|
|
33
|
+
0 0 5 0
|
|
34
|
+
|
|
35
|
+
----------------
|
|
36
|
+
New homomorphism
|
|
37
|
+
----------------
|
|
38
|
+
|
|
39
|
+
Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
|
|
40
|
+
Kernel: Z + Z_2
|
|
41
|
+
Cokernel: Z_15
|
|
42
|
+
Image: Z + Z_2
|
|
43
|
+
Reduced Matrix (torsion coordinates appear first):
|
|
44
|
+
0 3 0 0
|
|
45
|
+
0 0 10 15
|
|
46
|
+
|
|
47
|
+
----------------
|
|
48
|
+
New homomorphism
|
|
49
|
+
----------------
|
|
50
|
+
|
|
51
|
+
Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
|
|
52
|
+
Kernel: 2 Z + Z_2
|
|
53
|
+
Cokernel: Z
|
|
54
|
+
Image: Z_6
|
|
55
|
+
Reduced Matrix (torsion coordinates appear first):
|
|
56
|
+
3 3 2 4
|
|
57
|
+
0 0 0 0
|
|
58
|
+
|
|
59
|
+
------------------------------------
|
|
60
|
+
Miscellaneous vector representations
|
|
61
|
+
------------------------------------
|
|
62
|
+
|
|
63
|
+
Not in kernel
|
|
64
|
+
( 0 6 )
|
|
65
|
+
( 2 6 )
|
|
66
|
+
( 4 6 )
|
|
67
|
+
( 0 6 )
|
|
68
|
+
Not in kernel
|
|
69
|
+
( 1 1 4 2 )
|
|
70
|
+
( 0 1 4 2 )
|
|
@@ -0,0 +1,117 @@
|
|
|
1
|
+
# Regina - A Normal Surface Theory Calculator
|
|
2
|
+
# Python Test Suite Component
|
|
3
|
+
#
|
|
4
|
+
# Copyright (c) 2007-2023, Ben Burton
|
|
5
|
+
# For further details contact Ben Burton (bab@debian.org).
|
|
6
|
+
#
|
|
7
|
+
# Provides various tests for marked abelian groups.
|
|
8
|
+
#
|
|
9
|
+
# This file is a single component of Regina's python test suite. To run
|
|
10
|
+
# the python test suite, move to the main python directory in the source
|
|
11
|
+
# tree and run "make check".
|
|
12
|
+
#
|
|
13
|
+
# This program is free software; you can redistribute it and/or
|
|
14
|
+
# modify it under the terms of the GNU General Public License as
|
|
15
|
+
# published by the Free Software Foundation; either version 2 of the
|
|
16
|
+
#
|
|
17
|
+
# As an exception, when this program is distributed through (i) the
|
|
18
|
+
# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
|
|
19
|
+
# (iii) Google Play by Google Inc., then that store may impose any
|
|
20
|
+
# digital rights management, device limits and/or redistribution
|
|
21
|
+
# restrictions that are required by its terms of service.
|
|
22
|
+
# License, or (at your option) any later version.
|
|
23
|
+
#
|
|
24
|
+
# This program is distributed in the hope that it will be useful, but
|
|
25
|
+
# WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
26
|
+
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
27
|
+
# General Public License for more details.
|
|
28
|
+
#
|
|
29
|
+
# You should have received a copy of the GNU General Public
|
|
30
|
+
# License along with this program; if not, write to the Free
|
|
31
|
+
# Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,
|
|
32
|
+
# MA 02110-1301, USA.
|
|
33
|
+
|
|
34
|
+
def makeMatrix(values):
|
|
35
|
+
m = regina.MatrixInt(values)
|
|
36
|
+
return m
|
|
37
|
+
|
|
38
|
+
def makeGroup(valuesM, valuesN):
|
|
39
|
+
return regina.MarkedAbelianGroup(
|
|
40
|
+
makeMatrix(valuesM),
|
|
41
|
+
makeMatrix(valuesN))
|
|
42
|
+
|
|
43
|
+
def makeHom(domain, codomain, values):
|
|
44
|
+
return regina.HomMarkedAbelianGroup(
|
|
45
|
+
domain, codomain, makeMatrix(values))
|
|
46
|
+
|
|
47
|
+
def groupStats(g):
|
|
48
|
+
print("------------------------")
|
|
49
|
+
print("New marked abelian group")
|
|
50
|
+
print("------------------------")
|
|
51
|
+
print()
|
|
52
|
+
print('Group:', g)
|
|
53
|
+
|
|
54
|
+
print('Free generators:')
|
|
55
|
+
for i in range(g.rank()):
|
|
56
|
+
print(str(i) + ':', g.freeRep(i))
|
|
57
|
+
print('Torsion generators:')
|
|
58
|
+
for i in range(g.countInvariantFactors()):
|
|
59
|
+
print(str(i) + ':', g.torsionRep(i))
|
|
60
|
+
|
|
61
|
+
# Nothing else to say.
|
|
62
|
+
print()
|
|
63
|
+
|
|
64
|
+
def homStats(h):
|
|
65
|
+
print("----------------")
|
|
66
|
+
print("New homomorphism")
|
|
67
|
+
print("----------------")
|
|
68
|
+
print()
|
|
69
|
+
print(h.detail())
|
|
70
|
+
|
|
71
|
+
|
|
72
|
+
# Z + Z_6:
|
|
73
|
+
g1 = makeGroup([[1,1,1,1,1]],
|
|
74
|
+
[[2,2,6], [-2,0,0], [0,-1,-3], [0,-1,0], [0,0,-3]])
|
|
75
|
+
groupStats(g1)
|
|
76
|
+
|
|
77
|
+
# 2 Z + 2 Z_2:
|
|
78
|
+
g2 = makeGroup([[1,1,1,1,1]],
|
|
79
|
+
[[2,-6], [-2,0], [0,2], [0,2], [0,2]])
|
|
80
|
+
groupStats(g2)
|
|
81
|
+
|
|
82
|
+
# Hom: g2 -> g1, kernel Z + Z_2, cokernel Z_5:
|
|
83
|
+
homStats(makeHom(g2, g1,
|
|
84
|
+
[[5,5,11,0,7], [0,0,1,0,2], [0,0,-1,0,-2], [0,0,0,0,0], [0,0,-6,5,-2]]))
|
|
85
|
+
|
|
86
|
+
# Hom: g2 -> g1, kernel Z + Z_2, cokernel Z_15:
|
|
87
|
+
homStats(makeHom(g2, g1,
|
|
88
|
+
[[10,10,38,0,-5], [0,0,3,0,0], [0,0,-3,0,0], [0,0,0,0,0], [0,0,-28,10,15]]))
|
|
89
|
+
|
|
90
|
+
# Hom: g2 -> g1, kernel 2 Z + Z_2, cokernel Z:
|
|
91
|
+
homStats(makeHom(g2, g1,
|
|
92
|
+
[[-3,0,0,-1,1], [-3,0,0,-1,1], [3,0,0,1,-1], [0,0,0,0,0], [3,0,0,1,-1]]))
|
|
93
|
+
|
|
94
|
+
# Some playing with snfRep():
|
|
95
|
+
print("------------------------------------")
|
|
96
|
+
print("Miscellaneous vector representations")
|
|
97
|
+
print("------------------------------------")
|
|
98
|
+
print()
|
|
99
|
+
|
|
100
|
+
try:
|
|
101
|
+
print(g1.snfRep([-6,0,0,0,5]))
|
|
102
|
+
except InvalidArgument as e:
|
|
103
|
+
print('Not in kernel')
|
|
104
|
+
|
|
105
|
+
print(g1.snfRep([-6,0,0,0,6]))
|
|
106
|
+
print(g1.snfRep([-4,2,-2,0,4]))
|
|
107
|
+
print(g1.snfRep([-8,-2,2,0,8]))
|
|
108
|
+
print(g1.snfRep([0,6,-6,0,0]))
|
|
109
|
+
|
|
110
|
+
try:
|
|
111
|
+
print(g2.snfRep([0,-3,-1,3,0]))
|
|
112
|
+
except InvalidArgument as e:
|
|
113
|
+
print('Not in kernel')
|
|
114
|
+
|
|
115
|
+
print(g2.snfRep([0,-3,-1,3,1]))
|
|
116
|
+
print(g2.snfRep([-3,0,-1,3,1]))
|
|
117
|
+
|