regina 7.4.1__cp314-cp314-macosx_10_13_x86_64.whl

regina/sageRegina/testsuite/groups.out

@@ -0,0 +1,70 @@
+------------------------
+New marked abelian group
+------------------------
+
+Group: Z + Z_6 (Z^3 -> Z^5 -> Z^1)
+Free generators:
+0: ( -1 0 0 0 1 )
+Torsion generators:
+0: ( 3 -1 -1 0 -1 )
+
+------------------------
+New marked abelian group
+------------------------
+
+Group: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1)
+Free generators:
+0: ( -1 0 0 1 0 )
+1: ( -1 0 0 0 1 )
+Torsion generators:
+0: ( -1 1 0 0 0 )
+1: ( -3 0 1 1 1 )
+
+----------------
+New homomorphism
+----------------
+
+Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
+Kernel: Z + Z_2
+Cokernel: Z_5
+Image: Z + Z_6
+Reduced Matrix (torsion coordinates appear first):
+0 3 0 2
+0 0 5 0
+
+----------------
+New homomorphism
+----------------
+
+Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
+Kernel: Z + Z_2
+Cokernel: Z_15
+Image: Z + Z_2
+Reduced Matrix (torsion coordinates appear first):
+0 3 0 0
+0 0 10 15
+
+----------------
+New homomorphism
+----------------
+
+Hom: 2 Z + 2 Z_2 (Z^2 -> Z^5 -> Z^1) --> Z + Z_6 (Z^3 -> Z^5 -> Z^1)
+Kernel: 2 Z + Z_2
+Cokernel: Z
+Image: Z_6
+Reduced Matrix (torsion coordinates appear first):
+3 3 2 4
+0 0 0 0
+
+------------------------------------
+Miscellaneous vector representations
+------------------------------------
+
+Not in kernel
+( 0 6 )
+( 2 6 )
+( 4 6 )
+( 0 6 )
+Not in kernel
+( 1 1 4 2 )
+( 0 1 4 2 )

regina/sageRegina/testsuite/groups.test

@@ -0,0 +1,115 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2007-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Provides various tests for marked abelian groups.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+def makeMatrix(values):
+	m = regina.MatrixInt(values)
+	return m
+
+def makeGroup(valuesM, valuesN):
+	return regina.MarkedAbelianGroup(
+		makeMatrix(valuesM),
+		makeMatrix(valuesN))
+
+def makeHom(domain, codomain, values):
+	return regina.HomMarkedAbelianGroup(
+		domain, codomain, makeMatrix(values))
+
+def groupStats(g):
+	print("------------------------")
+	print("New marked abelian group")
+	print("------------------------")
+	print()
+	print('Group:', g)
+	
+	print('Free generators:')
+	for i in range(g.rank()):
+		print(str(i) + ':', g.freeRep(i))
+	print('Torsion generators:')
+	for i in range(g.countInvariantFactors()):
+		print(str(i) + ':', g.torsionRep(i))
+	
+	# Nothing else to say.
+	print()
+
+def homStats(h):
+	print("----------------")
+	print("New homomorphism")
+	print("----------------")
+	print()
+	print(h.detail())
+
+
+# Z + Z_6:
+g1 = makeGroup([[1,1,1,1,1]],
+	[[2,2,6], [-2,0,0], [0,-1,-3], [0,-1,0], [0,0,-3]])
+groupStats(g1)
+
+# 2 Z + 2 Z_2:
+g2 = makeGroup([[1,1,1,1,1]],
+	[[2,-6], [-2,0], [0,2], [0,2], [0,2]])
+groupStats(g2)
+
+# Hom: g2 -> g1, kernel Z + Z_2, cokernel Z_5:
+homStats(makeHom(g2, g1,
+	[[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]]))
+
+# Hom: g2 -> g1, kernel Z + Z_2, cokernel Z_15:
+homStats(makeHom(g2, g1,
+	[[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]]))
+
+# Hom: g2 -> g1, kernel 2 Z + Z_2, cokernel Z:
+homStats(makeHom(g2, g1,
+	[[-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]]))
+
+# Some playing with snfRep():
+print("------------------------------------")
+print("Miscellaneous vector representations")
+print("------------------------------------")
+print()
+
+try:
+	print(g1.snfRep([-6,0,0,0,5]))
+except InvalidArgument as e:
+	print('Not in kernel')
+
+print(g1.snfRep([-6,0,0,0,6]))
+print(g1.snfRep([-4,2,-2,0,4]))
+print(g1.snfRep([-8,-2,2,0,8]))
+print(g1.snfRep([0,6,-6,0,0]))
+
+try:
+	print(g2.snfRep([0,-3,-1,3,0]))
+except InvalidArgument as e:
+	print('Not in kernel')
+
+print(g2.snfRep([0,-3,-1,3,1]))
+print(g2.snfRep([-3,0,-1,3,1]))
+

regina/sageRegina/testsuite/hash.out

@@ -0,0 +1,66 @@
+sample string
+10
+Closed non-orientable 2-D triangulation, f = ( 1 3 2 )
+11
+Closed orientable 3-D triangulation, f = ( 1 6 10 5 )
+12
+Closed orientable 4-D triangulation, f = ( 24 27 108 135 54 )
+13
+Possibly closed orientable 5-D triangulation, f = ( 7 21 35 35 21 7 )
+14
+3-crossing knot: +++ ( ^0 _1 ^2 _0 ^1 _2 )
+15
+10
+16
+120
+17
+3120
+18
+31204
+19
+315204
+20
+3152064
+21
+31052064
+22
+3 Z + Z_3 + Z_6 + Z_24
+23
+5
+24
+8
+25
+inf
+26
+( 3 -2 0 6 )
+27
+( 3 inf -2 0 6 )
+28
+x - 6 + 5 x^-2
+29
+x^3 y^-2 + 4 x
+30
+0:2 1:1 0:0 | 1:2 0:1 1:0
+31
+1:0 2:0 3:0 4:0 | 0:0 2:1 4:1 3:1 | 0:1 1:1 3:3 4:2 | 0:2 1:3 4:3 2:2 | 0:3 1:2 2:3 3:2
+32
+0:3 1:4 1:0 0:0 1:2 | 0:2 1:3 0:4 1:1 0:1
+33
+1:0 2:0 3:0 4:0 5:0 6:0 | 0:0 2:1 3:1 4:1 5:1 6:1 | 0:1 1:1 3:2 4:2 5:2 6:2 | 0:2 1:2 2:2 4:3 5:3 6:3 | 0:3 1:3 2:3 3:3 5:4 6:4 | 0:4 1:4 2:4 3:4 4:4 6:5 | 0:5 1:5 2:5 3:5 4:5 5:5
+34
+4:1
+35
+8:0
+36
+8:3
+37
+8:5
+38
+0 -> 0 (012), 1 -> 1 (012), 2 -> 2 (012)
+39
+0 -> 0 (0123), 1 -> 1 (0123), 2 -> 2 (0123), 3 -> 3 (0123), 4 -> 4 (0123)
+40
+0 -> 0 (01234), 1 -> 1 (01234)
+41
+0 -> 0 (012345), 1 -> 1 (012345), 2 -> 2 (012345), 3 -> 3 (012345)
+42

regina/sageRegina/testsuite/hash.test

@@ -0,0 +1,84 @@
+# Regina - A Normal Surface Theory Calculator
+# Python Test Suite Component
+#
+# Copyright (c) 2015-2025, Ben Burton
+# For further details contact Ben Burton (bab@debian.org).
+#
+# Tests hashable classes.
+#
+# This file is a single component of Regina's python test suite.  To run
+# the python test suite, move to the main python directory in the source
+# tree and run "make check".
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# As an exception, when this program is distributed through (i) the
+# App Store by Apple Inc.; (ii) the Mac App Store by Apple Inc.; or
+# (iii) Google Play by Google Inc., then that store may impose any
+# digital rights management, device limits and/or redistribution
+# restrictions that are required by its terms of service.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+d = { 8: -1, 'foo': -2 }
+counter = 10
+
+def test(obj):
+	global counter
+	try:
+		print(obj)
+		d[obj] = counter
+		counter = counter + 1
+	except:
+		print('Cannot hash and insert:', obj)
+	
+	try:
+		c = type(obj)
+		print(d[c(obj)])
+	except:
+		print('Cannot hash and lookup:', obj)
+
+test('sample string')
+test(Example2.kb())
+test(Example3.poincare())
+test(Example4.k3())
+test(Example5.simplicialSphere())
+test(ExampleLink.trefoil())
+test(Perm2(1,0))
+test(Perm3(1,2,0))
+test(Perm4(3,1,2,0))
+test(Perm5(3,1,2,0,4))
+test(Perm6(3,1,5,2,0,4))
+test(Perm7(3,1,5,2,0,6,4))
+test(Perm8([3,1,8,5,2,0,6,4]))
+test(AbelianGroup(3, [3,6,24]))
+test(Integer(5))
+test(LargeInteger(8))
+test(LargeInteger.infinity)
+test(VectorInt([3,-2,0,6]))
+test(VectorLarge([3,'inf',-2,0,6]))
+test(Laurent(-2, [5,0,-6,1]))
+test(Laurent2([(3,-2,1), (1,0,4)]))
+test(Example2.kb().pairing())
+test(Example3.poincare().pairing())
+test(Example4.cappellShaneson().pairing())
+test(Example5.simplicialSphere().pairing())
+test(FacetSpec2(4,1))
+test(FacetSpec3(8,0))
+test(FacetSpec4(8,3))
+test(FacetSpec5(8,5))
+
+# TODO: Replace these with better (non-trivial but deterministic) examples.
+test(Isomorphism2.identity(3))
+test(Isomorphism3.identity(5))
+test(Isomorphism4.identity(2))
+test(Isomorphism5.identity(4))