On Thu, Sep 03, 2009 at 04:39:26AM -0700, Paul-Olivier Dehaye wrote:
>
> > > There are (at least) two bugs here:
> > > (1) sB is not in CommutativeRings()
> > > I'll fix this right now.
> > > (2) PowerSeriesRing should use
> > > base_ring in CommutativeRings()
> > > rather than
> > >
Hi sage-combinat developpers,
I just talk with somebody from Lyon (France) which works on (words)
complexity of polynoms/series over finite fields. Is there any tools
in SAGE for correspondance as :
polynoms over GF(p) <-> finite word on the alphabet GF(p)
One solution is the following...
> > There are (at least) two bugs here:
> > (1) sB is not in CommutativeRings()
> > I'll fix this right now.
> > (2) PowerSeriesRing should use
> > base_ring in CommutativeRings()
> > rather than
> > isinstance(base_ring, commutative_ring.CommutativeRing):
> > Would you be fine
