I expect <= to be a total order, so I prefer is_subgroup.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.goog
> >> What do people think about making the default ring for matrices QQ?
>
> > I have no objections to making QQ the defailt ring for matrices.
>
> I do. That's definitely *not* the proposal. The proposal is to make the
> base ring the fraction field of the canonical ring in which the list of
>
> [...] people are confused that when
> they create a matrix with matrix(3, range(9)), for example, that the
> echelon_form is not the rref output that they get from most any other
> program they have ever used [...]
> What do people think about making the default ring for matrices QQ?
>
I have no
The current implementation using InfinityRing and SignedInfinityRing
is very close to having a value saying "not defined" (i.e. NaN), and
viewed in that light the way things currently work makes sense. It
works for the purpose of not raising an exception on division by zero.
I am not at all sure I
Many otherwise intractable computations are possible on large monomial
ideals by using monomial ideal algorithms in place of the more
general algorithms. I am considering how best to give
users of Sage access to these algorithms, as they become available
through integration with Frobby. I would li
I have been trying out Cython in order to wrap a C++ library (Frobby)
for Sage, and I had a bit of trouble getting things set up. With help
from #sage-devel I have managed to get a minimal example running now,
and I promised to describe what I came up with, so I've packaged it up
as a very simple
As a first effort of getting Frobby into Sage, I have an spkg ready at
http://www.broune.com/frobby-0.7.3.spkg
along with a Python interface at
http://www.broune.com/frobby.py
This interface does irreducible decomposition of monomial ideals using
Frobby. I've also created a trac ticket at
h
> > sage -t devel/sage/sage/modular/abvar/morphism.py *** ***
> > Error: TIMED
> > OUT! *** ***
> > *** *** Error: TIMED OUT! *** ***
> > [1358.6 s]
> > [...]
>
> Odd, it shouldn't time out on that machine. I am hoping William or
> Craig can take a close look since they are much
Sage builds without problems on this system
SAGE Version 3.0, Release Date: 2008-04-22
Mac OS X 10.5.2
1.8 GHz Intel Core 2 Duo
2 GB RAM
gcc version 4.0.1 (Apple Inc. build 5465)
while make test produces the following errors (that I noticed)
[listing begin]
[...]
sage -t devel/sage/sage/plot/a
On 30 Mar., 19:15, "David Joyner" <[EMAIL PROTECTED]> wrote:
> Just a few ideas. Hopefully someone who is more of an expert on
> commutative algebra computations will weigh in.
>
> The usual procedure is to
> (1) make an optional SAGE package (spkg file - see the programming
> manual, maybe use th
I am the author of the program Frobby, which does computations on
monomial ideals. I think Sage is a great project, and I would like to
contribute by making it possible to use Frobby as a part of Sage. My
question is whether Frobby is an appropriate thing to add to Sage, and
if so how I might begi
11 matches
Mail list logo
