Fix ignoring non-monics with all coefficients divisible by uniformize…

…r. Fixes in FrameElt.

src/sage/rings/polynomial/padics/factor/factoring.py

@@ -104,6 +104,8 @@ def dist_den(facts,multval):
     if multval > 0:
         uni = Kx(uni)
         facts = [Kx(fact) for fact in facts]
+    if multval < 0:
+        uni = uni * f.base_ring().uniformizer() ** -multval
     return Factorization([(uni,1)]+[(fact,1) for fact in facts])
 
 def pfactor(Phi):

src/sage/rings/polynomial/padics/factor/frameelt.py

@@ -358,15 +358,15 @@ def polynomial(self,denominator=False):
             sage: fe1.polynomial()
             (6 + O(2^20))*x^2 + (0 + O(2^20))*x + (1 + O(2^20))
         """
-        if min([a._exponent for a in self.terms]) < 0:
-            raise ValueError, "Cannot cconstruct polynomial representation of FrameElt with negative exponents"
         if denominator:
             piexp = self.find_denominator()
             if piexp < 0:
                 return (self * FrameElt(self.frame,self.frame.Ox(self.frame.O.uniformizer()**(-piexp)))).polynomial(),-piexp
             else:
                 return self.polynomial(),0
         else:
+            if min([a._exponent for a in self.terms]) < 0:
+                raise ValueError, "Cannot construct polynomial representation of FrameElt over Zp with negative exponents without denominator flag"
             if self.frame.is_first():
                 return self.frame.O.uniformizer()**int(self.terms[0]._exponent)*self.terms[0]._unit
             else:
@@ -862,7 +862,7 @@ def is_reduced(self):
         """
         if self.frameelt.frame.prev is None:
             return True
-        if self._exponent < self.frameelt.frame.prev.segment.Eplus:
+        if self._exponent < self.frameelt.frame.prev.segment.Eplus * self.frameelt.frame.prev.Fplus:
             return self._coefficient.is_reduced()
         return False