A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
We study the map which sends vectors of polynomials into their Wronski determinants. This defines a projection map of a Grassmann variety which we call a Wronski map. Our main res...