These Thurston maps are NET maps for every choice of translation term. They have degree 15. They are imprimitive, each factoring as a NET map with degree 5 followed by a Euclidean NET map with degree 3. PURE MODULAR GROUP HURWITZ EQUIVALENCE CLASSES FOR TRANSLATIONS {0,lambda2,lambda1+lambda2} {lambda1} 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 7. ALL THURSTON MULTIPLIERS c/d IN UNREDUCED FORM 0/1, 0/3, 1/15, 1/3, 3/5, 3/1 EXCLUDED INTERVALS FOR THE HALF-SPACE COMPUTATION (-infinity,-0.014180) ( 0.014180,infinity ) 1/0 is the slope of a Thurston obstruction with c = 3 and d = 1. These NET maps are not rational. SLOPE FUNCTION INFORMATION NUMBER OF FIXED POINTS: 2 EQUATOR? FIXED POINT c d 0 lambda1 lambda2 lambda1+lambda2 1/0 3 1 No No No No 0/1 1 15 Yes Yes No No NUMBER OF EQUATORS: 1 1 0 0 There are no more slope function fixed points. Number of excluded intervals computed by the fixed point finder: 298 No nontrivial cycles were found. Here is the action of the slope function on an invariant set S of slopes. N/1 -> 3N/1 The set S contains infinitely many infinite slope function trajectory tails. The slope function maps some slope to the nonslope. If the slope function maps slope s to a slope s' and if the intersection pairing of s with 1/0 is n, then the intersection pairing of s' with 1/0 is at most n. The slope function orbit of every slope whose intersection pairing pairing with 1/0 is at most 50 either ends in the nonslope or ends in one of the slopes described above or it has an infinite tail in one of the infinite sets described above. FUNDAMENTAL GROUP WREATH RECURSIONS When the translation term of the affine map is 0: NewSphereMachine( "a=<1,a*b,b,b,1,1,1,1,1,1,1,1,1,b^-1,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "b=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "c=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "d=<1,a*b,c^-1,c^-1,c^-1,c^-1,1,1,1,c,c,c,c,c,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "a*b*c*d"); When the translation term of the affine map is lambda1: NewSphereMachine( "a=<1,1,a*b,b,1,1,1,1,1,1,1,1,1,b^-1,b^-1>(1,2)(3,15)(4,14)(5,13)(6,12)(7,11)(8,10)", "b=<1,a*b,b,b,1,1,1,1,1,1,1,1,1,b^-1,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "c=<1,a*b,c^-1,c^-1,c^-1,c^-1,1,1,1,c,c,c,c,c,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "d=<1,1,c^-1,c^-1,c^-1,c^-1,c^-1,1,1,1,c,c,c,c,c*d>(1,2)(3,15)(4,14)(5,13)(6,12)(7,11)(8,10)", "a*b*c*d"); When the translation term of the affine map is lambda2: NewSphereMachine( "a=(1,14)(2,13)(3,12)(4,11)(5,10)(6,9)(7,8)", "b=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "c=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "d=(1,14)(2,13)(3,12)(4,11)(5,10)(6,9)(7,8)", "a*b*c*d"); When the translation term of the affine map is lambda1+lambda2: NewSphereMachine( "a=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "b=<1,a*b,c^-1,c^-1,c^-1,c^-1,1,1,1,c,c,c,c,c,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "c=<1,a*b,b,b,1,1,1,1,1,1,1,1,1,b^-1,c*d>(2,15)(3,14)(4,13)(5,12)(6,11)(7,10)(8,9)", "d=(1,15)(2,14)(3,13)(4,12)(5,11)(6,10)(7,9)", "a*b*c*d");