Question: Finding the shortest coefficient in a polynomial

I have a polynomial in the variables ya[i] and yd[i] where i are integers. I want to divide each of the coefficients by the 'shortest' coeficient. What i mean by that is the coefficient that is going to cause me the least trouble when i later do things with groebner bases of on the coefficients - I expect a good proxy for that is the one that has the smallest number of terms.

For example, for the polynomial:


2*k[a1]*k[d1] is the shortest monomial coefficient


Please Wait...