Probabilistic Saturations and Alt’s Problem

Abstract

Alt's problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial equations which was first solved numerically using homotopy continuation by Wampler, Morgan, and Sommese in 1992. Since there is still not a proof that all solutions were obtained, we consider upper bounds for Alt's problem by counting the number of solutions outside of the base locus to a system arising as the general linear combination of polynomials. In particular, we derive effective symbolic and numeric methods for studying such systems using probabilistic saturations that can be employed using both finite fields and floating-point computations. We give bounds on the size of finite field required to achieve a desired level of certainty. These methods can also be applied to many other problems where similar systems arise such as computing the volumes of Newton-Okounkov bodies and computing intersection theoretic invariants including Euler characteristics, Chern classes, and Segre classes.

On the equations defining some Hilbert schemes

“…In each case, showing that the scheme is irreducible and reduced is now equivalent to showing that the top-dimensional irreducible component has the same Hilbert series as the entire scheme; this precludes the existence of embedded components. This was verified using [6] with certified numerical Hilbert function computations [12]. In fact, this also showed that each scheme is arithmetically Cohen-Macaulay.…”