"""
Anyone got an idea what I should do to fix the warning?
Cheers,
Martin
[1] http://trac.sagemath.org/sage_trac/ticket/13851#comment:9
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D
ing about including
his experimental package in the reference manual. My understanding is that
this is currently not possible.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA
Okay, looks like I can move it then (?)
On Thursday 13 Dec 2012, William Stein wrote:
> On Thu, Dec 13, 2012 at 11:26 AM, Martin Albrecht
>
> wrote:
> > Hi,
> >
> > why is the email() function implemented in sagenb instead of sage. It
> > would seem it s
Hi,
why is the email() function implemented in sagenb instead of sage. It would
seem it should be part of Sage but it's in
sagenb.sagenb.notebook.sage_email
btw. I am asking for
http://trac.sagemath.org/sage_trac/ticket/13829
Cheers,
Martin
--
name: Martin Albrecht
_pgp:
slightly off topic.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
You received this message be
uilla/Desktop/sage-5.3/local/include/m4ri/mzd.h:447:5: error:
> ‘for’ loop initial declarations are only allowed in C99 mode
> /Users/cbouilla/Desktop/sage-5.3/local/include/m4ri/mzd.h: In function
> ‘mzd_hash’:
> /Users/cbouilla/Desktop/sage-5.3/local/include/m4ri/mzd.h:1396:3: error:
&
axed...
>
> I must admit that I don't know exactly how to investigate and make a
> good report on this :-/
>
> Do other ARM owners see the same thing?
>
> Snark on #sagemath
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&
ebra.DifferentialRing.toto
> (sage/libs/blad/DifferentialAlgebra.c:8999)()
>
> /home/boulier/tmp/sage-5.3-linux-64bit-ubuntu_10.04.4_lts-x86_64-Linux/loca
> l/lib/python2.7/site-packages/sage/libs/blad/DifferentialAlgebra.so in
> ()
>
> NameError: name 'a' is not d
ink they thought it might work well for a Bug Days.
>
> Rob
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...
legroups.com
> > To unsubscribe from this group, send an email to
>
> sage-devel+unsubscr...@googlegroups.com
>
> > For more options, visit this group at
>
> http://groups.google.com/group/sage-devel
>
> > URL: http://www.sagemath.org
Cheers,
Mart
%timeit faster_random_invertible_matrix2(1000, GF(2))
> 5 loops, best of 3: 24.9 ms per loop
>
> As the matrix sizes get bigger, the random permutation method appears
> to be about 2x slower than the whole random matrix method.
>
> Cheers,
> Javier
Cheers,
Marti
For comparison: PLE decomposition needs 2.8 multiplications if asymptotically
fast multiplication is used and 0.66 if cubic multiplication is used, cf.
http://arxiv.org/pdf/1112.5717.pdf
On Tuesday 03 Jul 2012, Dima Pasechnik wrote:
> On Tuesday, 3 July 2012 20:22:37 UTC+8, Martin Albre
we
> > have now, and it is very easy to implement while we think of a better
> > solution.
>
> well, pseudorandom field element generation is not very cheap, and
> generating "good" pseudorandom elements got be be expensive, otherwise
> some (generally believed to be
ng:
> >> 1) uniformly select a random maximal flag
> >> 2) uniformly select a random element U in the subgroup stabilizing the
> >> "canonical" maximal flag, i.e. the one stabilized by the
> >> upper triangular matrices.
> >> Then an el
Hi,
On Tuesday 03 Jul 2012, Simon King wrote:
> Hi!
>
> On 2012-07-02, Martin Albrecht wrote:
> > Shouldn't both give the same distribution mod p? Since every non-singular
> > matrix A has a LU decomposition we should be able to just sample L and U
> > separately
; something special about GL(n, F) that we're trying to achieve?
> Otherwise, I think the generate-and-check, perhaps re-defining a
> single random entry on failure, is an evener distribution.
>
> - Robert
>
> On Mon, Jul 2, 2012 at 3:32 PM, Martin Albrecht
>
> wrote:
gt; sage: %timeit faster_random_invertible_matrix(64, GF(2))
> 125 loops, best of 3: 1.8 ms per loop
>
> ---> this is about 15000 times faster
>
> How do you feel about this ? It's not a bug stricto sensu, but
> math-oriented people might stumble across GL(N,K).rando
make the behaviour of comparison a bit more
> predictable?
Yep, I vote for: take the most trivial integer representation of the finite
field and order according to this.
GF(p): order integers < p
GF(p^e): order the integers c_i*p^i where c_i are the coefficients in
polynomial representations
PS: Your code is very very fast! Thanks for including it in Sage!
On Monday 25 Jun 2012, Martin Albrecht wrote:
> Hi,
>
> ah, thanks for explaining! I confused her recent work with the complexity
> of computing Gröbner bases, but it's about combining exhaustive search an
stive
search at round 200.
On Monday 25 Jun 2012, Charles Bouillaguet wrote:
> On 06/25/2012 07:00 PM, Martin Albrecht wrote:
> >> It is interesting to have such an algorithm in sage, because despite
> >> being simple, it is asymptotically faster than the computation of a
> >&
c systems, but it seems to be 1
for exhaustive search?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
-
o "experimental" though. I am
> however pretty clueless regarding the next steps to take.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.word
oes this indicate a lack of doctests in Sage, or is the failure in a
> > feature which isn't used by Sage?
>
> I don't know. Anybody who knows exactly which parts of Givaro we use is
> welcome to look at the strack trace at
>
> http://trac.sagemath.org/9511
Cheers,
Ma
t; Though of course it would be best to fix the bug, override the generic
> method, and add a doctest there.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://mar
t they are looking for.
>
> Question/Poll: should html.table be imported globally, so that the
> tab-completion above has an additional entry? It seems like this would help
> a lot of people find a fairly obscure function.
>
> Thanks,
> - kcrisman
Cheers,
Martin
--
name: Martin
Okay, I don't get this failure with my copy of 5.0.1 on my machine and
geom.math. So all doctests pass now!
On 16 June 2012 15:30, Martin Albrecht wrote:
> Hi again,
>
> On 11 June 2012 14:47, Martin Albrecht wrote:
>> Update, we are down to these doctest failures:
>>
Hi again,
On 11 June 2012 14:47, Martin Albrecht wrote:
> Update, we are down to these doctest failures:
>
> 1) File
> "/opt/sage-5.0-linbox/devel/sage/sage/tests/french_book/numbertheory.py",
> line 43:
> sage: [r for r in R]
> Expected:
> [0, 2*x, x + 1
polynomial systems
This needs review. It should be relatively easy because almost everything is
optional anyway.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www:
+1
-- sent from a telephone.
On Jun 14, 2012 9:32 PM, "Volker Braun" wrote:
> Since we are using references to trac in the manuals, how about we allow
> trac urls for tickets of the form
>
> http://trac.sagemath.org/
>
> instead of the current
>
> http://trac.sagemath.org/sage_trac/ticke
No takers? :)
On 11 June 2012 14:47, Martin Albrecht wrote:
> Update, we are down to these doctest failures:
>
> 1) File
> "/opt/sage-5.0-linbox/devel/sage/sage/tests/french_book/numbertheory.py",
> line 43:
> sage: [r for r in R]
> Expected:
> [0, 2*x
is contradicts the way every other functions behave.
I don't seem to understand what you mean, as this works fine:
sage: P. = BooleanPolynomialRing()
sage: x.variables()
(x,)
sage: (x+1).variables()
(x,)
> b) in multi_polynomial_libsingular.pyx, line 16865, this is a
> TypeError, while
ed:
Traceback (most recent call last):
...
TypeError: Coordinates [a + 1, 0, 1] do not define a point on
Hyperelliptic Curve over Finite Field in a of size 3^2 defined by y^2
+ (x^2 + a)*y = x^7 + 2
Could someone familiar with the code weight in?
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:1
.
I also built Sage 5.0 + these patches on /scratch/malb/sage-5.0-linbox
on sage.math. So you can test it without building it first.
Cheers,
Martin
PS: I will be AFK for the weekend starting now-ish.
On 7 June 2012 19:43, Martin Albrecht wrote:
> On 7 June 2012 19:37, Jason Grout wrote:
nicer.
Only my five cents :)
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com
_jab: martinralbre...@jabber.ccc.de
--
To post to this group
On 7 June 2012 19:37, Jason Grout wrote:
> On 6/7/12 1:32 PM, Martin Albrecht wrote:
>>
>> Hi,
>>
>> Brice (for [sage-devel]: he's from the LinBox project) and I are at
>> the "Efficient Linear Algebra for Gröbner Basis Computations" workshop
&
ewer atlas and linbox...
>
>
>
>
> On Thursday, June 7, 2012 7:32:15 PM UTC+1, Martin Albrecht wrote:
>>
>> Brice (for [sage-devel]: he's from the LinBox project) and I are at
>> the "Efficient Linear Algebra for Gröbner Basis Computations" workshop
>&g
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com
_jab: martinralbre...@jabber.ccc.de
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:1
ac/ticket/12840
* M4RI update (because of the Givaro update):
http://trac.sagemath.org/sage_trac/ticket/12841
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht
e' to under 'blah/include/cryptominisat/' so when you
> have to use '#include "cryptominisat/Solver.h"' for example. I hope you
> agree it's much better this way. I have also fixed some other, misc
> things in the makefile.
Sounds good :)
Cheers,
why do you install stdint.h in Makefile.am? It seems it's only
relevant on Windows where Makefile.am shouldn't be used?
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://marti
orney leaving UW soon for another job, this
> has to happen ASAP if it is going to happen, so please respond by **
> Monday, June 4 **. (Emailing me offlist at wst...@uw.edu is fine
> too.)
>
> [1] http://www.sagetrac.org/
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit
't know the difference between the two, otherwise. Neither
> appears to be wrapped directly in Sage, judging from
> mpolynomial_libsingular.pxd.
The closest we come to using them directly is in the groebner_strategy.pyx
file.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.
On Thursday 03 May 2012, Simon King wrote:
> Hi Martin,
>
> On 3 Mai, 16:08, Martin Albrecht
>
> wrote:
> > Can you update to
> >
> > http://trac.sagemath.org/sage_trac/ticket/12840
> >
> > and see if that fixes the issue? It's a bit of a
The former, PolyBoRi needs to be linked against the new M4RI library. I'd
suggest to do this in a copy of your Sage install, you never know what my
update will cause (although I tested it etc)
On Thursday 03 May 2012, Simon King wrote:
> Hi Martin,
>
> On 3 Mai, 16:08, M
ctive session, I get
> sage: sr = mq.SR(2,1,2,4,gf2=True,polybori=True)
> sage: sr
> SR(2,1,2,4)
> sage: set_random_seed(1)
> sage: F,s = sr.polynomial_system()
> sage: F
> Polynomial Sequence with 112 Polynomials in 64 Variables
>
> Can you please give me
le licence, by the way...
>
> Dima
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this gr
SPKGs. This thread was merely meant to invite
people to do the same and to discuss potential issues.
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: m
Hi,
On Sunday 15 Apr 2012, Keshav Kini wrote:
> Martin Albrecht writes:
> > Hi,
> >
> > I don't know about you, but I screw up surprisingly often when it comes
> > to cutting SPKGs (starting off from old versions, copying wrong files
> > etc.).
> >
cloned the M4RI and M4RIE *SPKG* repositories here:
https://bitbucket.org/malb/m4ri-spkg
https://bitbucket.org/malb/m4rie-spkg
for those who want to play with it.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D
Hi,
I was wondering how hard it would be (i.e., whether someone knows of a Trac
plugin for this) to allow replying to Trac comments via e-mail. It would speed
up the trivial to answer question response time etc.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup
Hi David,
On Friday 13 Apr 2012, David Joyner wrote:
> On Fri, Apr 13, 2012 at 7:22 AM, Martin Albrecht
>
> wrote:
> > Hi there,
> >
> > in May there is going to be a PhD summer school on "Tools for
> > Cryptography" in Mykonos, Greece [1].
> &
ykonos.psom.pdf http://bit.ly/ID12Ye
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to
: f = (x*y + x)
sage: f.coefficient(x)
y + 1
That is, the answer could actually be a polynomial.
> Best regards,
> Simon
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www:
ost ready.
However, I ran into this Singular bug when looking at
http://trac.sagemath.org/sage_trac/ticket/7795
> ring r = 3,(T,z),dp;
> poly f = z^3 + T*z;
> f^(3^15);
Segmentation fault
It doesn't seem to be a simple "catch the overflow" bug. Any ideas?
Cheers,
Martin
--
nam
On Friday 02 Mar 2012, Simon King wrote:
> Hi Martin,
>
> On 2 Mrz., 11:59, Martin Albrecht
>
> wrote:
> > Meaning: knock yourselves out adding/filling in your
> >
> > favourite base ring :)
>
> I added some information on my MeatAxe fork wrappe
base ring :)
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this group, send an emai
think is pretty nice.
- it feels to me like: let's switch software to address a social problem.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wor
ttps://confluence.atlassian.com/display/BITBUCKET/Forking+a+bitbucket+Repository
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: mart
Hi, I don't run OSX often but from what I gather from posts here this
should be relevant:
http://kennethreitz.com/xcode-gcc-and-homebrew.html
Cheers,
Martin
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubs
the spkg-install scripts expect, so from
their perspective nothing would change for now.
>
> --Mike
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.
e was denied, and the
> organization decided against funding it because the developers didn't
> know us personally; their "no" was not based on weaknesses of the
> project itself, which I found frustrating. So it's best if we are a
> mentoring organization.
>
> --
bout his code.
> I do not know.
Please stop spreading such paranoid rumours. Nathann didn't look at your
patch, there is nothing to suggest he "refused to" or even that about you.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&s
Thanks,
>
> Snark on #sagemath
Did you by any chance test whether switching to unsigned char in the
matrix_mod2 reduce function indeed fixes the issue? I don't have an ARM box
here to test?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&s
an in precompiled versions as they
> probably should be...
They are compiled but use generic data structures only. They are also very
cache unfriendly (column index in outer loop, then row index). We could
probably gain something by simply swapping those.
Cheers,
Martin
--
name: Martin Al
Z which likely is faster than
what we wrap of NTL. Having that readily available in Sage would be awesome!
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wo
lt;32 \
| ((word)row[8*j+3])<<24 | ((word)row[8*j+2])<<16 \
| ((word)row[8*j+1])<< 8 | ((word)row[8*j+0])<< 0;
A->rows[i][j] = ~tmp;
}
tmp = 0;
switch((n/8 + ((n%8) ? 1 : 0))%8) {
case 7: tmp |= ((word)row[8*j+7])<<56;
f time.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this group, send an email to sage-
he inputs (starting with
"?" i guess), filter all the synchronisation code etc.
>
> Thanks
> Jean-François
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: ht
sed versions, or are there any which carry
> alphas and betas/rc ?
They usually also mirror the latest alpha/beta, e.g.
http://www.mirrorservice.org/sites/www.sagemath.org/devel/
> John
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8
ke Hansen (5%), Rob Beezer (4%), Rado Kirov (5%),
Volker Braun (3%)...
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre
Append(~_sage_, 0);
> >
> > Append(~_sage_, 0);
> >
> >>>>_sage_[9]:=Factorization(_sage_[5]);
> >
> > _sage_[9]:=Factorization(_sage_[5]);
> > Integer main factorization (primality of factors will be proved)
> > Effort: 3
> >
On Wednesday 14 December 2011, Volker Braun wrote:
> On Wednesday, December 14, 2011 12:18:58 AM UTC, Martin Albrecht wrote:
> > It uses the "Student-t" method to estimate the certainty
>
> This is precisely what the python documentation warns about (see Nils'
>
print (-d: dump) each measurement
* (0:microseconds
* 1:cpuclocks).
It uses the "Student-t" method to estimate the certainty (don't ask me what
that is, I don't know).
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0
Hi, LinBox uses the BLAS for dense matrices mod p where p <= 2^23, hence it
would benefit from advances in that direction. There is also some
(experimental?) code for dealing with non-prime fields in LinBox.
Furthermore, there is some code - AFAIK not in LinBox yet - for packing
multiple primes int
Tom, Simon's MeatAxe fork implements its own Strassen. But perhaps Sage's
asymptotically fast Gaussian elimination could be useful?
On Dec 1, 2011 9:09 AM, "Tom Boothby" wrote:
> On Wed, Nov 30, 2011 at 6:52 AM, Simon King
> wrote:
> > Hi Dima,
> >
> > On 30 Nov., 15:29, Dima Pasechnik wrote:
>
Fax: (+33) (0)5 40 00 69 50
351, cours de la Liberationhttp://www.math.u-bordeaux1.fr/~belabas/
F-33405 Talence (France) http://pari.math.u-bordeaux1.fr/ [PARI/GP]
`
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D
Box does support
> > non-prime finite fields but even Clément couldn't make it work easily
> > IIRC.
>
> I remember they have non-prime fields. But at least #4260 doesn't use
> it.
Yep, that's correct.
> Best regards,
> Simon
Cheers,
Martin
--
name: Mart
# six multiplications needed for Karatsuba at degree 3
5.70
which isn't that much faster than your 7.5 seconds, but the approach
could be easily made to work for all extensions up to, say, degree, 10
and wouldn't be limited to p < 255.
On the other hand, talking about the "
0xfec8370c in _exithandle () from /lib/libc.so.1
#16 0xfec73f52 in exit () from /lib/libc.so.1
#17 0xfeef3232 in Py_Exit (sts=0) at Python/pythonrun.c:1716
#18 0xfeef3357 in handle_system_exit () at Python/pythonrun.c:1116
#19 0x in ?? ()
Now I only need to fix it :(
Cheers,
Martin
--
name: M
.so.1
#11 0xfec73f52 in exit () from /lib/libc.so.1
#12 0xfeef3232 in Py_Exit (sts=0) at Python/pythonrun.c:1716
#13 0xfeef3357 in handle_system_exit () at Python/pythonrun.c:1116
#14 0x in ?? ()
Any C++ expert out there with a good explanation what this means?
Cheers,
Martin
--
name: M
On Tuesday 22 November 2011, Volker Braun wrote:
> Maybe you can tell us which environment variables you have set up? Do you
> have something akin to
>
> LD_LIBRARY_PATH=/usr/local/gcc-4.5.0/lib:/usr/local/gcc-4.5.0/lib/amd64
>
> On Tuesday, November 22, 2011 12:08:55 PM UT
RY_PATH=/usr/local/gcc-4.5.0/lib:/usr/local/gcc-4.5.0/lib/amd64/
PATH=/usr/local/bins-for-
sage/:/usr/local/bin:/usr/local/gcc-4.5.0/bin/:/usr/bin:/bin
I didn't actually have LD_LIBRARY_PATH before but now, when I set it it still
fails.
> On Tuesday, November 22, 2011 12:08:55 PM UTC, M
rs,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this group, send an email to sage-devel@googleg
lab.
>
> http://www.sagemath.fr/
> http://www.sagemath.org
> http://sagemath-edu.fr/wiki/
> --
> Nicolas M. Thiéry "Isil"
> http://Nicolas.Thiery.name/
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&se
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this group, send an email to sage-devel@googlegroups.com
T
an or not. Hence, additional modules need to be loaded for my PS1 to work
as expected.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_ja
clear reminder that we're using a subshell, but can
> we shorten this to one line? (My votes: no, I don't find it useful, and
> yes, I would prefer that it were shorter.)
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0D
On Friday 28 October 2011, William Stein wrote:
> On Thu, Oct 27, 2011 at 12:57 PM, Volker Braun
wrote:
> > On Thursday, October 27, 2011 1:38:34 PM UTC-4, Martin Albrecht wrote:
> >> Sure, but it's still worrisome that a computation is slower in
> >> libSingular
it's still worrisome that a computation is slower in libSingular
than in Singular. If it's down to the different memory manager, then there
isn't much we (can/will) do about, in which case it's at least good to know:
e.g. computing a GB using pexpect might be faster if ther
f
Sage 1.4 (!) I compared various malloc replacements:
http://wiki.sagemath.org/MallocReplacements
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbr
On Thursday 27 October 2011, Simon King wrote:
> Hi Martin,
>
> On 27 Okt., 11:39, Martin Albrecht
>
> wrote:
> > On Thursday 27 October 2011, Simon King wrote:
> > > Is that something to worry about?
> >
> > Yes!
>
> Good. I created trac ticket
n confirm this behaviour. The problem doesn't seem to be restricted to
__pow__, i.e. replacing ^i by products also gives slower results when using
using libSingular. However, mod p it seems libSingular wins. Hence my guess:
we are using different memory allocation functions for GMP and the
On Tuesday 25 October 2011, Jason Grout wrote:
> On 10/25/11 10:40 AM, Martin Albrecht wrote:
> > Jason asked me off list to jump in because I work in crypto. Btw. I am
> > actually don't work in network security so I am not really an expert on
> > the matter. But for wha
However, from the website it seems, tcpcrypt doesn't guarantee privacy in the
default setting except against passive attackers, i.e. those which can only
listen but not control traffic on the network. But if there is a shared secret
such as a password, it can optionally use authentication.
Ch
27;s
okay.
Any takers?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
To post to this group, se
Hi there,
are there any ZShell users around?
I'm asking because
http://trac.sagemath.org/sage_trac/ticket/11866
fixes the ZShell prompt after "sage -sh" and needs review.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&sea
I just fixed the one speed-regression Simon pointed out, so the patch
http://trac.sagemath.org/sage_trac/ticket/4260 needs a review again
... hint, hint!
On 25 August 2011 04:41, Martin Albrecht wrote:
> Hi everybody,
>
> it's the last day of Sage Days 32 and I push Burcin's
basic algebras (about which I
know nothing).
However, there might be other applications out there. Hence my question: do
you (want to) use efficient dense linear algebra over small finite fields with
characteristic two for your research and if so, what is your research?
Thanks!
Martin
ds a discussion on [sage-devel] because it's about
adding *more* stuff to the global namespace, while we try to keep that
to a minimum.
Thoughts?
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D
his issue?
> If not, you can open one and cc me.
Okay, I've CCed you from
http://trac.sagemath.org/sage_trac/ticket/11574
> I'm also on #sagemath btw., or feel free to mail me off-list.
In the spirit of William's "post more" encouragement shouldn't we keep
this
101 - 200 of 993 matches
Mail list logo
