Hi,
I have a system of 64 inhomogeneous linear equations with 781 unknowns
over the field of two elements.
I am looking for a solution with at most 38 non-zero unknowns.
Is there an efficient way to do this? Any references?
As you can guess the question is about reversing a hash, more
specifica
Hi,
Sage Bug Day 16 will be Thursday, November 13. Sign up now.
http://wiki.sagemath.org/bug16
For local Seattle people, some Sage devs are also meeting for lunch at 12pm
at Araya's.
-- William
--
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org
I got the same matrix_double_dense failure as J. Palmieri on intel
macs running 10.4 and 10.5, plus this one which only occured on the
10.5 machine:
sage -t devel/sage/sage/calculus/wester.py
**
File "/Users/mh/sagestuff/sage-3.
mabshoff wrote:
>
> Sources and a sage.math only binary can be found at
>
> http://sage.math.washington.edu/home/mabshoff/release-cycles-3.2/
>
On Fedora 9, 32 bits the one and only failure:
sage -t devel/sage/sage/combinat/root_system/weyl_characters.py*** *** Error:
TIMED OUT! *** ***
**
> Expect some numerical noise doctest failures and some other related
> known issues. Please report issues here and check trac for existing
> tickets.
On an intel mac running 10.5 (after changing my stone-age shell :),
sage -testall has two or three problems:
the known numerical noise problem in
On Tue, Nov 11, 2008 at 1:00 PM, mabshoff <[EMAIL PROTECTED]> wrote:
>
> I know it is late, but will we do a Bug Day this Thursday as planned?
> Either way we should announce one for next Thursday now.
>
Yes, definitely, we'll have Bug Day Thursday as planned!
Mark your calendar.
William
> Chee
I know it is late, but will we do a Bug Day this Thursday as planned?
Either way we should announce one for next Thursday now.
Cheers,
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, se
On Nov 11, 12:07 pm, mabshoff <[EMAIL PROTECTED]> wrote:
> On Nov 11, 12:02 pm, John H Palmieri <[EMAIL PROTECTED]> wrote:
>
>
>
> > On Nov 11, 11:57 am, Jaap Spies <[EMAIL PROTECTED]> wrote:
>
> > > John H Palmieri wrote:
> > > > On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
> > > >> He
>> - Did anyone keep a list or graph of the desired categories from
>> sage days 7?
>>For reference, the hierarchy for MuPAD-Combinat is available there:
>>http://mupad-combinat.sourceforge.net/Papers/Categories.pdf
>
> I thought someone took a photo of it, but I don't know who.
>
I
On Nov 11, 12:02 pm, John H Palmieri <[EMAIL PROTECTED]> wrote:
> On Nov 11, 11:57 am, Jaap Spies <[EMAIL PROTECTED]> wrote:
>
>
>
> > John H Palmieri wrote:
> > > On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
> > >> Hello folks,
>
> > >> here is 3.2.rc0 and I have to confess that I ch
Jaap Spies wrote:
> John H Palmieri wrote:
>> On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
>>> Hello folks,
>>>
>>> here is 3.2.rc0 and I have to confess that I cheated: I did build this
>>> on numerous platforms before announcing here (if you hung out in IRC
>>> you knew about this rel
On Nov 11, 11:57 am, Jaap Spies <[EMAIL PROTECTED]> wrote:
> John H Palmieri wrote:
> > On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
> >> Hello folks,
>
> >> here is 3.2.rc0 and I have to confess that I cheated: I did build this
> >> on numerous platforms before announcing here (if you
John H Palmieri wrote:
> On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
>> Hello folks,
>>
>> here is 3.2.rc0 and I have to confess that I cheated: I did build this
>> on numerous platforms before announcing here (if you hung out in IRC
>> you knew about this release for about 6 hours now
On Nov 11, 11:27 am, John H Palmieri <[EMAIL PROTECTED]> wrote:
> On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
>
> > Hello folks,
>
> > here is 3.2.rc0 and I have to confess that I cheated: I did build this
> > on numerous platforms before announcing here (if you hung out in IRC
> > y
On Nov 11, 4:24 am, mabshoff <[EMAIL PROTECTED]> wrote:
> Hello folks,
>
> here is 3.2.rc0 and I have to confess that I cheated: I did build this
> on numerous platforms before announcing here (if you hung out in IRC
> you knew about this release for about 6 hours now) and as it turns out
> my cau
Hi Thomas,
I am interested in monomial ideal computations in Sage, and I'm very
open to discuss it, but I won't have time to really work on it until
after Christmas. When I did some work on this earlier, I did not find
any special monomial ideal classes. So in the interface to Frobby I
had to use
Hi,
I have linked a diff for a first version from the ticket at
http://trac.sagemath.org/sage_trac/ticket/4470
It should not be considered anything final yet, i.e. the rename has
not been done yet. I am about to fly back, so hopefully in the next
day I will have a patch ready for the review pro
Hi,
I should point out that the class hierarchy should not be confused
with the categories.
The latter are intended to model the mathematics. In particular a
homomorphism in
the category of rings should satisfy f(x*y) = f(x)*f(y). Each class
is assigned a default
category, but the idea is that
> Polynomials over Fields of Characteristic zero in the beginning. But the
> algorithms are formulated in the general setting. But all the
> applications that come to my mind are for characteristic 0.
okay, you'll get support for QQ and absolute number fields using libSingular.
Relative number f
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Martin Albrecht wrote:
> On Tuesday 11 November 2008, Thomas Kahle wrote:
>> Dear all,
>
> Hi [sage-devel] and CC Carlo Traverso who might find this discussion
> relevant/.
>
>> I would like to develop a program that does primary decomposition of
>
Ralf Hemmecke <[EMAIL PROTECTED]> writes:
> The only difference between Sage and Aldor/panAxiom is that Sage checks
> whether the Object can be coerced to SomeType at runtime whereas Aldor
> and SPAD allow to check at compile time.
I don't think this is the full story. As far as I can see, it
Hello folks,
here is 3.2.rc0 and I have to confess that I cheated: I did build this
on numerous platforms before announcing here (if you hung out in IRC
you knew about this release for about 6 hours now) and as it turns out
my caution was justified. Doctesting is broken with this release
unless y
Hello folks,
I raised the issue with optional doctest failures in Sage 3.2.a0 a
while back and I am glad to report that we have made some progress
here:
sage -t -long -optional devel/sage/sage/tests/benchmark.py # 4
doctests failed
sage -t -long -optional devel/sage/sage/rings/po
On 11/11/2008 11:38 AM, Martin Rubey wrote:
> Robert Bradshaw <[EMAIL PROTECTED]> writes:
>
>> In Sage, we use the term "coercion" to denote a canonical (using the
>> term a bit loosely), implicit map between Parents (or objects of a
>> concrete category). E.g. from ZZ to F5 would be a "coerc
On Nov 11, 3:38 am, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
> On Tuesday 11 November 2008, Thomas Kahle wrote:
Hi Thomas, Martin,
> > Dear all,
>
> Hi [sage-devel] and CC Carlo Traverso who might find this discussion
> relevant/.
> > 4ti2 Integration: I know from the authors, that 4ti2 w
On Tuesday 11 November 2008, Thomas Kahle wrote:
> Dear all,
Hi [sage-devel] and CC Carlo Traverso who might find this discussion
relevant/.
> I would like to develop a program that does primary decomposition of
> binomial ideals really fast.
> Some hopefully useful algorithms are given in a '9
Robert Bradshaw <[EMAIL PROTECTED]> writes:
> In Sage, we use the term "coercion" to denote a canonical (using the
> term a bit loosely), implicit map between Parents (or objects of a
> concrete category). E.g. from ZZ to F5 would be a "coercion," but
> there is a "conversion" and not a "co
On Nov 11, 2008, at 1:53 AM, Ralf Hemmecke wrote:
> On 11/10/2008 10:31 PM, koffie wrote:
>>> sage: C = VectorSpaces(GF(5))
>>> sage: C
>>> Category of vector spaces over Finite Field of size 5
>>> sage: W = (ZZ^3).span([[1,2,3],[4,5,3]])
>>> sage: W
>>>
>>> Free module of degree 3 and rank 2 ove
On 11/10/2008 10:31 PM, koffie wrote:
>> sage: C = VectorSpaces(GF(5))
>> sage: C
>> Category of vector spaces over Finite Field of size 5
>> sage: W = (ZZ^3).span([[1,2,3],[4,5,3]])
>> sage: W
>>
>> Free module of degree 3 and rank 2 over Integer Ring
>> Echelon basis matrix:
>> [1 2 3]
>> [0 3 9
> Finally, I should note that I do not agree with Ralf's views (quoting
> Doye's article on Aldor) on the importance of universal algebra
> notions to categories in Axiom.
Maybe it belongs somewhere else, but how would you explain to someone
who is new to Aldor/panAxiom, what the concept of "ca
Dear all,
I would like to develop a program that does primary decomposition of
binomial ideals really fast.
Some hopefully useful algorithms are given in a '96 Paper by David
Eisenbud and Bernd Sturmfels. At least the second author is very
interested in this project and has many possible applicat
31 matches
Mail list logo
