These Thurston maps are NET maps for every choice of translation term. They are primitive and have degree 3. 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 10. ALL THURSTON MULTIPLIERS c/d IN UNREDUCED FORM 1/3, 1/1 EXCLUDED INTERVALS FOR THE HALF-SPACE COMPUTATION (-infinity,0.000000) ( 0.000000,0.250000) ( 0.250000,0.333333) ( 0.333333,0.375000) ( 0.375000,0.400000) ( 0.400000,0.416667) ( 0.416667,0.428571) ( 0.428571,0.437500) ( 0.437500,0.443239) ( 0.445600,0.450000) ( 0.450000,0.453655) ( 0.455402,0.458333) ( 0.458333,0.460903) ( 0.462963,0.464286) ( 0.464286,0.465517) ( 0.467742,0.468750) ( 0.468750,0.469697) ( 0.530303,0.531250) ( 0.531250,0.532258) ( 0.534483,0.535714) ( 0.535714,0.537037) ( 0.539097,0.541667) ( 0.541667,0.544598) ( 0.546345,0.550000) ( 0.550000,0.554400) ( 0.556761,0.562500) ( 0.562500,0.571429) ( 0.571429,0.583333) ( 0.583333,0.600000) ( 0.600000,0.625000) ( 0.625000,0.666667) ( 0.666667,0.750000) ( 0.750000,1.000000) ( 1.000000,infinity) -2/1 is the slope of a Thurston obstruction with c = 1 and d = 1. These NET maps are not rational. SLOPE FUNCTION INFORMATION EQUATOR? FIXED POINT c d 0 lambda1 lambda2 lambda1+lambda2 -2/1 1 1 No No No No (-4N+1)/2N 1 3 No Yes No Yes (-4N+3)/(2N-1) 1 3 No Yes Yes No (-4N+4)/(2N-1) 1 3 Yes Yes No No There are no more slope function fixed points. Number of excluded intervals computed by the fixed point finder: 56 No nontrivial cycles were found. The slope function maps every slope to a slope: no slope maps to the nonslope. If the slope function maps slope s to a slope s' and if the intersection pairing of s with -2/1 is n, then the intersection pairing of s' with -2/1 is at most n. The slope function orbit of every slope whose intersection pairing with -2/1 is at most 50 ends in one of the slopes described above. FUNDAMENTAL GROUP WREATH RECURSIONS When the translation term of the affine map is 0: NewSphereMachine( "a=<1,b,1>(2,3)", "b=(1,3)", "c=(2,3)", "d=(1,2)", "a*b*c*d"); When the translation term of the affine map is lambda1: NewSphereMachine( "a=(1,3)", "b=(1,2)", "c=(1,3)", "d=(2,3)", "a*b*c*d"); When the translation term of the affine map is lambda2: NewSphereMachine( "a=(1,3)", "b=(2,3)", "c=(1,3)", "d=(1,2)", "a*b*c*d"); When the translation term of the affine map is lambda1+lambda2: NewSphereMachine( "a=(1,2)", "b=(1,3)", "c=(1,2)", "d=<1,b^-1*a*b,1>(2,3)", "a*b*c*d");