arXiv subjects
Publications and source records attributed to Jakob Kröker.
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a problem in dynamical systems raised by Cui.
We compare a heuristic count of components of the center variety in degree 3 with the equivalent count obtained from known families. From this comparison we conjecture that more than 100 unknown components exist.
We prove that the vanishing of 11 focal values is not sufficient to ensure that a plane cubic system has a center.
We prove that the moduli space of plane curves of degree d is rational for all sufficiently large d.