You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
generator walking down r/s pleating ray from -10 to -2 (say) with a step either uniform in [-10,2] or in the moduli space (general for all polynomials)
selection of correct cusp from roots of Farey polynomial
continued fraction approximation of cusp groups
add subclass CuspGroup of ClassicalRileyGroup
The text was updated successfully, but these errors were encountered:
Choose the solution z_0 to (2) with angle closest to pi*p/q. Set L_0 = Phi_p/q(z_0). This should be in (-infty, -2)
Let N be the desired number of points, set epsilon = |L_0 + 2|/N. Iterate Newton's method to find z_n (n in 1 to N), starting from z_n-1, that solves Phi_p/q = L_0 + N*epsilon.
In farey.py we now have an implementation of Newton's algorithm
and other paraphernalia to compute points on pleating rays.
There is also a new example, parabolic_slice_pleating_rays.py.
This is the first half of the features listed in #18.
The text was updated successfully, but these errors were encountered: