> I have no time at the moment to look at this patch. I used it to do
> some computations which were completely undoable with the standard
> implementation of FractionField, and which became extremely fast
> using this implementation.
> So the lukewarm (to say the least) reaction by some very mu
Hi David,
On Thu, Mar 12, 2009 at 10:03:53AM -0700, David Kohel wrote:
> First, I think (at least last time I tried) there is a lot of room
> to speed up arithmetic in function fields, which would be my first
> priority.
> Second, as a mathematical construction, I think that the
> local
On Fri, Mar 13, 2009 at 4:03 AM, David Kohel wrote:
>
> Hi,
>
> First, I think (at least last time I tried) there is a lot of room to
> speed
> up arithmetic in function fields, which would be my first priority.
>
> Second, as a mathematical construction, I think that the
> localizations
> A_S w
Hi,
First, I think (at least last time I tried) there is a lot of room to
speed
up arithmetic in function fields, which would be my first priority.
Second, as a mathematical construction, I think that the
localizations
A_S where A is a ring (e.g. UFD or PID) and S = {p_1,...,p_n} is a
set
of pri
Hi Nicolas,
I have no time at the moment to look at this patch. I used it to do
some
computations which were completely undoable with the standard
implementation of FractionField, and which became extremely fast
using this implementation.
So the lukewarm (to say the least) reaction by some very
> > For the record, my ring is currently S[t], where S is the ring of
> > symmetric functions in the e basis. You probably are not that
> > surprised about that :-)
>
> Is it easy to factor such polynomials? How do you do it?
Well, it's a free algebra, so you could always coerce to
QQ['e1,e2,..
Martin Rubey writes:
> "Nicolas M. Thiery" writes:
>
> > > actually, this would be my dream, too! (I think I proposed something
> > > like this on fricas-devel already, but I don't remember well.)
> >
> > :-) Please provide a pointer if you find back your e-mail.
>
> sorry, very unlikely :-
"Nicolas M. Thiery" writes:
> > actually, this would be my dream, too! (I think I proposed something
> > like this on fricas-devel already, but I don't remember well.)
>
> :-) Please provide a pointer if you find back your e-mail.
sorry, very unlikely :-(
> > But perhaps you should make sure
On Mon, Mar 09, 2009 at 08:07:42PM +0100, Martin Rubey wrote:
>
> "Nicolas M. Thiery" writes:
>
> > Let me dream a bit. I very much like the idea of Factored(Ring), where
> > elements are kept in factored form as long as possible, as is done in
> > FriCas (thanks Martin for the pointer). I woul
"Nicolas M. Thiery" writes:
> Let me dream a bit. I very much like the idea of Factored(Ring), where
> elements are kept in factored form as long as possible, as is done in
> FriCas (thanks Martin for the pointer). I would like to have several
> variants to choose from:
>
> - PartiallyFactored
Dear Michel,
On Mon, Mar 09, 2009 at 12:03:34AM -0700, Michel wrote:
> A long time ago I made a FractionFIeld implementation which would
> cache factorizations of denominators. instead of taking gcd's all the
> time
>
> http://markmail.org/message/7hxox5cbz5knxjse#query:new%20implementat
Michel writes:
> Hi Nicolas,
>
> A long time ago I made a FractionFIeld implementation which would
> cache factorizations of denominators. instead of taking gcd's all the
> time
>
> http://markmail.org/message/7hxox5cbz5knxjse#query:new%20implementation%20of%20fraction%20field+page:1+mid:5bf3l
Hi Nicolas,
A long time ago I made a FractionFIeld implementation which would
cache factorizations of denominators. instead of taking gcd's all the
time
http://markmail.org/message/7hxox5cbz5knxjse#query:new%20implementation%20of%20fraction%20field+page:1+mid:5bf3l37bsim34m4g+state:results
It i
13 matches
Mail list logo
