These Thurston maps are NET maps for every choice of translation term.
They are primitive and have degree 12.
PURE MODULAR GROUP HURWITZ EQUIVALENCE CLASSES FOR TRANSLATIONS
{0} {lambda1} {lambda2} {lambda1+lambda2}
Since no Thurston multiplier is 1, this modular group Hurwitz class
contains only finitely 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, 1/6, 1/2, 3/2, 4/2
EXCLUDED INTERVALS FOR THE HALF-SPACE COMPUTATION
(-infinity,-0.037867)
(-0.034975,-0.034004)
(-0.033793,-0.032886)
(-0.030683,-0.029933)
(-0.029769,-0.029063)
(-0.027329,-0.026732)
(-0.026602,-0.026036)
(-0.024636,-0.024150)
(-0.024043,-0.023580)
(-0.022426,-0.022022)
(-0.021934,-0.021548)
(-0.020580,-0.020240)
(-0.020165,-0.019838)
( 0.019838,0.020165 )
( 0.021093,0.021463 )
( 0.021548,0.021934 )
( 0.023037,0.023479 )
( 0.023580,0.024043 )
( 0.025375,0.025912 )
( 0.026036,0.026602 )
( 0.028242,0.028909 )
( 0.029063,0.029769 )
( 0.031839,0.032689 )
( 0.032886,0.033793 )
( 0.035346,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
(-0.053478,-0.022472) -2/53 HST
(-0.037131,-0.036944) -1/27 EXTENDED HST
(-0.025343,-0.019509) -7/312 HST
(-0.204065,0.256577 ) 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.
Number of excluded intervals computed by the fixed point finder: 1190
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,d,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,c^-1,1,1,1,1,1,1,1,1,c,1>(1,4)(2,11)(3,6)(5,8)(7,10)(9,12)",
"b=<1,d,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,d,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");
**