Theory says that we can always reduce to integers and
reduction code is supposed to implement this theory. I see that
thing which should produce integer does not give one, so
there is a bug.
Theoretical picture is as follows: as raw input data we have base
field which is supposed to essentially be finite algebraic extention
of rational functions in several variables. Function that we want
to integrate is an algebraic function over base field. Which means
that we have variable (anonymous as we use SUP), rational functions
in that variable and then we we algebraic extention of that.
Before we get to PFO we transform things so that at algebraic function
level corresponding extenstion has single integral generator, that
is there is single algebraic kernel which generates the function
field and its defining polynomial has leading coefficient equal to 1.
and coefficients that are polynomials over base field.
In PFO we are supposed to have stronger thing: base field should
be transformed in similar way, that is have integers at the bottom,
then we have possibly multiple polynomial variables, then we have
a single kernel which is integral over polynomials.
But it looks that kernel passed to selectIntegers (which is supposed
to be integral generator of base field) has defining polynomial
with noninteger coefficients...
--
Waldek Hebisch