Monodromy — where it appears
Named by 4 essays across one field — each of them below, with the objects they name alongside it.
The paths that leave
Bézout's number over-counts, and the over-count is enormous — 1,458 tracked paths for 80 solutions. The obvious response is to find a method that tracks only the paths that arrive. That method exists, it was built, and it is four times slower, because the surplus paths are not merely surplus. They are cheap.
The search that was right
This site has reported sixteen assemblies for its Gough platform and labelled the number a lower bound found by search, everywhere it appears. Tracking every path says there are twenty-eight poses and sixteen of them are real. The lower bound was tight. Nothing available to the search could have said so, and a second method that was supposed to settle it turns out to have the same defect one level up.
A degree counted on a line
A curve of degree six meets a general line in six points, and that sentence is a way to measure the degree with no equation in it. Written as polynomials, a four-bar and a random complex line have eight paths to track; six arrive on every line tried, the other two run off towards the circular points, and a sum of the six stays straight to fifteen figures only when none is missing.
The curve nobody eliminates
A point on the arm of the site's dwell six-bar draws a curve whose equation nobody writes down and no fit can find: at degree eighteen a fit needs a hundred and ninety coefficients, and its singular values have no gap to decide by. Sliced by a random line, the same machine has thirty-two paths to track and eighteen arrive, on every line tried, all eighteen distinct and all on one curve.
Named alongside it
The objects these essays reach for when they reach for this one.
Homotopy continuationAlgebraic curveDegreeGough platformImplicit equationTrace testWitness setAssembly branchBezoutComputational costCoupler curveDirect kinematics