These Thurston maps are NET maps for every choice of translation term.
They have degree 12. They are imprimitive, each factoring as a NET map
with degree 6 followed by a Euclidean NET map with degree 2.
PURE MODULAR GROUP HURWITZ EQUIVALENCE CLASSES FOR TRANSLATIONS
{0} {lambda1} {lambda2} {lambda1+lambda2}
These pure modular group Hurwitz classes each contain
infinitely many Thurston equivalence classes.
The number of pure modular group Hurwitz classes
in this modular group Hurwitz class is 24.
ALL THURSTON MULTIPLIERS c/d IN UNREDUCED FORM
0/2, 0/6, 2/6, 2/2
EXCLUDED INTERVALS FOR THE HALF-SPACE COMPUTATION
(-infinity,-1.000000)
(-1.000000,-0.040816)
(-0.039335,-0.037626)
(-0.033987,-0.032704)
(-0.029920,-0.028921)
(-0.026722,-0.025922)
(-0.024141,-0.023487)
(-0.022015,-0.021470)
(-0.020234,-0.019772)
( 0.019772,0.020234 )
( 0.021470,0.022015 )
( 0.023487,0.024141 )
( 0.025922,0.026722 )
( 0.028921,0.029920 )
( 0.032704,0.033987 )
( 0.037626,infinity )
The half-space computation does not determine rationality.
EXCLUDED INTERVALS FOR JUST THE SUPPLEMENTAL HALF-SPACE COMPUTATION
INTERVAL COMPUTED FOR HST OR EXTENDED HST
(-1.106456,-0.912209) -1/1 EXTENDED HST
(-0.051282,-0.027027) -1/25 EXTENDED HST -> HST
(-0.035088,-0.018182) -1/37 EXTENDED HST -> HST
(-0.142837,0.200078 ) 0/1 EXTENDED HST
The supplemental half-space computation shows that these NET maps are rational.
SLOPE FUNCTION INFORMATION
There are no slope function fixed points because every
loop multiplier of the mod 2 slope correspondence graph
is at least 1 and the map is rational.
No nontrivial cycles were found.
The slope function maps some slope to the nonslope.
The slope function orbit of every slope p/q with |p| <= 50
and |q| <= 50 ends in the nonslope.
If the slope function maps slope p/q to slope p'/q', then |q'| <= |q|
for every slope p/q with |p| <= 50 and |q| <= 50.
FUNDAMENTAL GROUP WREATH RECURSIONS
When the translation term of the affine map is 0:
NewSphereMachine(
"a=(2,10)(3,11)(4,8)(5,9)",
"b=**(1,11)(2,12)(3,9)(4,10)(5,7)(6,8)",
"c=<1,1,c,c^-1,1,1,1,1,1,1,1,1>(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)",
"d=(1,12)(2,3)(4,5)(6,7)(8,9)(10,11)",
"a*b*c*d");
When the translation term of the affine map is lambda1:
NewSphereMachine(
"a=(1,3)(2,12)(4,10)(5,11)(6,8)(7,9)",
"b=(3,11)(4,12)(5,9)(6,10)",
"c=<1,1,1,1,c,c^-1,1,1,1,1,1,1>(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)",
"d=(1,12)(2,3)(4,5)(6,7)(8,9)(10,11)",
"a*b*c*d");
When the translation term of the affine map is lambda2:
NewSphereMachine(
"a=<1,a*b,1,1,1,1,1,1,1,1,c*d,1>(1,4)(2,11)(3,6)(5,8)(7,10)(9,12)",
"b=<1,1,c,c^-1,1,1,1,1,1,1,1,1>(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)",
"c=****(1,11)(2,12)(3,9)(4,10)(5,7)(6,8)",
"d=(1,9)(3,7)(4,12)(6,10)",
"a*b*c*d");
When the translation term of the affine map is lambda1+lambda2:
NewSphereMachine(
"a=<1,a*b,1,1,1,1,1,1,1,1,c*d,1>(1,4)(2,11)(3,6)(5,8)(7,10)(9,12)",
"b=<1,1,1,1,c,c^-1,1,1,1,1,1,1>(1,2)(3,4)(5,6)(7,8)(9,10)(11,12)",
"c=(3,11)(4,12)(5,9)(6,10)",
"d=****(1,11)(2,4)(3,9)(5,7)(6,12)(8,10)",
"a*b*c*d");
**