On Wednesday 11 Nov 2015 04:06:21 Emmanuel Charpentier wrote:
> Dear list,
>
> I just discovered that Sage installs a Boost library (it's, curiously,
> called boost-cropped, but according to its SPKG.txt, currently contains all
> of Boost, without patches).
>
> The current version is 1.52. I disc
Hi,
I'd just add a function groebner_basis(F) to sage.libs.giac (or wherever the
Giac Cython interface lives) which takes a Sage sequence, computes a Gröbner
basis and returns a Sage sequence.
Integrating that into multi_polynomial_ideal.py is then very easy.
I've created
http://trac.sage
Agreed, I was just hoping someone else would do the work for me :)
On Monday 29 Jun 2015 14:59:15 Simon King wrote:
> Hi Martin,
>
> On 2015-06-29, 'Martin Albrecht' via sage-devel wrote:
> > Can we add a more convenient interface for computing Gröbner bases with
>
On Sunday 21 Jun 2015 02:35:19 Han Frederic wrote:
> I'd like to point out that recently http://trac.sagemath.org/ticket/12375
> was closed. I'd like also to thank here all the participants.
>
> Since sage 6.8.beta5, giac and its cython interface giacpy are avaible as
> optional packages.
>
>
On Saturday 20 Jun 2015 11:10:21 William Stein wrote:
> On Sat, Jun 20, 2015 at 11:01 AM, Titouan COLADON
>
> wrote:
> > We propose a new C++ package implementing the F4 algorithm.
> >
> > We open this post in order to make it standard if the community agree.
>
> To clarify, I think these are t
On Sunday 14 Jun 2015 17:21:21 R. Andrew Ohana wrote:
> I think the main reason why Sage has its own Cython bindings is mainly
> historical -- they existed before polybori added their own python bindings.
> It would probably be a better idea to use polybori's own bindings in Sage
> -- it makes no s
Hi all,
On Saturday 13 Jun 2015 10:41:15 Francois Bissey wrote:
> I think Andrew has already done quite a bit of the porting to autotools and
> some python 3 fixes. But neither he or I want to be a maintainer - at least
> for the long term.
ah, sorry that I missed that. Great! How about this:
1.
On Saturday 13 Jun 2015 10:08:32 Francois Bissey wrote:
> > On 13/06/2015, at 22:00, 'Martin Albrecht' via sage-devel
> > wrote:
> >
> > Hi all,
> >
> > On Friday 12 Jun 2015 13:45:05 R. Andrew Ohana wrote:
> >> What about this:
> >&
Hi all,
FYI, I put this out. Let's see if there *are* other users besides me:
https://martinralbrecht.wordpress.com/2015/06/13/polybori-is-dead-it-needs-your-help/
Cheers,
Martin
On Saturday 13 Jun 2015 11:00:16 Martin Albrecht wrote:
> Hi all,
>
> On Friday 12 Jun 2015 13:4
Hi all,
On Friday 12 Jun 2015 13:45:05 R. Andrew Ohana wrote:
> What about this:
>
> Now: We work on making polybori an optional package in sage.
> * At least going by this thread, the number of people who use polybori in
> Sage is small enough for it to make sense to have polybori as an option
Hi,
so, the Singular team *wants* to keep PolyBoRi alive, but it's currently not
clear if and when they *can* devote resources to it. This will be clarified
over the next few months it seems.
Cheers,
Martin
On Friday 12 Jun 2015 10:14:53 Martin Albrecht wrote:
> I started talking
I started talking to some people from the symbolic computation community to
discuss options (e.g. if someone wants to take over maintenance). Hence, don't
rush to a conclusion please, I'd really like to keep PolyBoRi around somehow
but don't want to be (sole) maintainer.
Cheers,
Martin
On Thur
Hi all,
I use it. Not as much as I used to (my research moved on) but it would be
rather if it was gone. I also know that some people in my field use it, i.e.
the BooleanPolynomialRing. If that was gone, we'd go from okay-ish to hell-ish
for computing with an object which quite naturally arises
Hi all,
Philipp Jovanovic just had the same problem. Does it work for anyone?
Cheers,
Martin
On Friday 08 May 2015 17:41:26 Bill Page wrote:
> Is it working? I tried to reset my password. sage-trac sent me an
> email with a new one but it does seem to work. Anybody try this
> lately?
>
> ---
Hi Vincent,
no hard feelings at all! It's hard to figure out a good balance for these
kinds of things and one way is to try it out: I sent a request and people who
object to such requests …object. Then we discuss :)
Back to the topic of discussion: I guess I'm up for more such requests on
here
Hi all,
http://trac.sagemath.org/ticket/18320 fixes a performance issue with
polynomial sequences which are used for multivariate polynomials to e.g. store
Gröbner bases and stuff. The patch is very short, it would be nice if someone
could look at it as it makes a huge difference for large syst
Hi,
if you care about SAT solving or memory leaks, could you review this one line
patch?
- del self
+del self._solver
http://trac.sagemath.org/ticket/18318
We never called the C++ destructor of the CryptoMiniSat class which means
memleaks, big time.
Cheers,
Martin
--
You
On Wednesday 22 Apr 2015 14:10:51 Jeroen Demeyer wrote:
> And then there are these, which seem to be external packages, but I
> couldn't find a corresponding upstream:
>
> src/sage/stats/distributions/*.c
Upstream (autotool-ised and all) is here:
https://bitbucket.org/malb/dgs
Cheers,
Martin
Hi,
can you perhaps give a bit more context? Firstly, I'm not sure everybody here
knows why Edwards curves are cool. Secondly, what does your library do and how
does that compare to everything else out there.
Cheers,
Martin
On Friday 20 Feb 2015 01:04:36 Adarsh Saraf wrote:
> Hello everybody,
+1 from me.
On Wednesday 18 Feb 2015 07:13:03 William Stein wrote:
> Hi Sage Developers,
>
> Several people and events have suggested to me that the official name
> of "Sage" should be filled out to be "SageMath", like the website url
> (which is sagemath.org and has been since I bought it in 200
Hi Simon,
over GF(2) it helps to multiply from the left:
sage: A = random_matrix(GF(2), 1024, 1024)
sage: v = random_matrix(GF(2), 1024, 1)
sage: %timeit A*v
1 loops, best of 3: 85 µs per loop
sage: vT = v.transpose()
sage: AT = A.transpose()
sage: %timeit vT*AT
10 loops, best of 3: 15 µs
Hi, here's a reply from a PolyBoRi developer:
-- Forwarded Message --
Subject: Re: [Polybori-discuss] Fwd: Re: [sage-devel] Re: Python 3 focused
SageDays
Date: Saturday 10 Jan 2015, 22:19:16
From: Alexander Dreyer
To: Martin Albrecht , Polybori Discuss
Hi M
On Tuesday 11 Nov 2014 02:43:19 Joe ouni wrote:
> > "/opt/sage-6.0-x86_64-Linux/local/lib/python2.7/site-packages/sage/structu
> > re/sequence.py",>
> > > line 944, in __getattr__
> > >
> > > raise AttributeError("'Sequence_generic' object has no attribute
> > >
> > > '%s'"%name)
> > > Attri
Oh, looks like we never implemented that, but we should (it's straight
forward). This is now:
http://trac.sagemath.org/ticket/16924
Cheers,
Martin
On Tuesday 02 Sep 2014 22:05:29 Thierry wrote:
> Hi,
>
> looking at this ask question :
> http://ask.sagemath.org/question/24024/satisfying-ass
Hi all,
at http://trac.sagemath.org/ticket/15915 there's a ticket which is ready to go
except potentially for some non-deterministic 32-bit doctest failure.
That ticket implements discrete Gaussian samplers and one instantiation is
non-deterministic (using random() for speed). This particular
to
> other packages but set the defaults to using flint whenever possible.
>
> Thanks for the feedback!
>
> Marc.
>
> On Tuesday, August 12, 2014 7:00:38 PM UTC+1, wstein wrote:
> > On Tue, Aug 12, 2014 at 10:52 AM, Martin Albrecht
> >
> > > wrote:
&g
Hi, I like the proposal to move some types over to FLINT. However, you removed
some options, e.g. calling Pari, LinBox or IML for solving certain problems
(charpoly, kernel, …). I'd prefer these options to be preserved as it is not
clear to me a priori that FLINT will in all cases be fastest. Al
> Am Montag, 4. August 2014 19:26:44 UTC+2 schrieb Martin Albrecht:
> > Hi all,
> >
> > anyone up for reviewing:
> >
> > 1)
> >
> > http://trac.sagemath.org/ticket/15672
> >
> > which fixes a simple bug in the Magma interface when
Hi all,
anyone up for reviewing:
1)
http://trac.sagemath.org/ticket/15672
which fixes a simple bug in the Magma interface when computing Gröbner bases.
2)
http://trac.sagemath.org/ticket/16585
which improves Polynomial Sequences and fixes many small annoyances there.
Cheers,
Martin
si
Sure, this was about fixing a bug introduced in said ticket (which I now found
:)
On Tuesday 08 Jul 2014 00:29:18 Eric Gourgoulhon wrote:
> Hi,
>
> Le lundi 7 juillet 2014 22:22:10 UTC+2, Martin Albrecht a écrit :
> > Hi,
> >
> > over at http://trac.sagemath.org/tic
Hi,
over at http://trac.sagemath.org/ticket/12718 I am encountering a strange
doctest failure:
This will fail in a fresh instance of Sage:
sage: matrix(QQ['x,y'], 2, 2, [1, 1, 1, 1]) / x
with a TypeError (no error message)
However, if I do:
sage: matrix(QQ['x,y'], 2, 2, [1, 1, 1, 1]) *
Hi,
Sage Days 59 is about to wrap up. A few bugs were fixed and are awaiting
review on Trac:
http://trac.sagemath.org/query?status=needs_info&status=needs_review&keywords=~sd59
Please take a few moments to check that list and review some patches. It would
be a shame to let them bitrot.
On
already fixed it seems: http://trac.sagemath.org/ticket/16485
On Friday 27 Jun 2014 17:43:13 Nicolas M. Thiery wrote:
> Hi!
>
> I have a zero-dimensional ideal of polynomials over the rational, and
> getting an error when requesting the solutions over QQbar:
>
> sage: R. = QQ[]
>
Indeed, congratulations!
On Monday 16 Jun 2014 12:59:08 kcrisman wrote:
> http://youtu.be/I9Myt5NTeCc
>
>
> Congratulations, Volker!
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from i
On Thursday 05 Jun 2014 20:58:55 you wrote:
> Do I need to book a hotel or can we stay at the house?
You will need to book a hotel room, see:
https://groups.google.com/forum/#!topic/bugdays/FhB7gi1JY80
You should also subscribe to that list to stay in the loop.
> Is there anyone who could ge
Thanks Keith.
On Tuesday 03 Jun 2014 10:10:11 you wrote:
> I fixed the DNS record, so the site should be back up now.
>
> -Keith
>
> On Tuesday, June 3, 2014 4:16:35 AM UTC-7, Martin Albrecht wrote:
> > Hi, it seems m4ri.sagemath.org is down (it's hosted by Sage as t
Hi, it seems m4ri.sagemath.org is down (it's hosted by Sage as the URL
indicates), did anything change recently?
Cheers,
Martin
-- Forwarded Message --
Subject: [m4ri-devel] Website and automake
Date: Tuesday 03 Jun 2014, 06:12:50
From: william
To: m4ri-de...@googlegroups.co
We've done some templating before when Cython didn't speak C++ so well and/or
when C code was involved.
1. sage.rings.polynomials.polynomial_template provides a way to wrap
univariate polynomials.
It is used by three classes:
polynomial_gf2x
polynomial_zmod_flint
polynomial_zz_pex
2. Matrix_m
Hi all,
is there a way to add a hook to the SageTerminalApp, i.e. that part of Sage
which takes part of normal shell I/O? I'd like my local Sage install to be
behave as follows:
* if execution takes longer than, say, 5 minutes, print the wall + cpu time
* if execution takes longer than, say,
Hi there,
over at http://trac.sagemath.org/ticket/16322 we're fixing all the # optional
- magma doctest failures.
There's one more to take care off. I'm sure this is trivial to some of you, so
I am posting it here :)
sage -t --long src/sage/rings/number_field/number_field.py
**
I was motivated by this thread to look into pip again. I like it, so +1 for
inclusion.
We might e.g. drop SQLAlchemy in return,which would Sage smaller instead of
bigger. It is trivial to install using pip, it seems no code in the library
depends on it, and the version we are shipping is very
/github.com/Singular/Sources)
>
>
> Jack
>
> Am Mittwoch, 7. Mai 2014 14:00:11 UTC+2 schrieb Jean-Pierre Flori:
> > On Wednesday, May 7, 2014 1:51:41 PM UTC+2, Martin Albrecht wrote:
> >> Hi,
> >>
> >> which version of Singular should be upgrade to? I
Hi,
which version of Singular should be upgrade to? I see that 3-1-6 is the most
recent one and this seems to be shipped with Sage. What am I missing?
Cheers,
Martin
On Wednesday 07 May 2014 04:41:18 kroe...@uni-math.gwdg.de wrote:
> Hello,
>
>
> I would like to switch with our project in alg
Hi all,
sage: P = PolynomialRing(GF(127),10, 'x')
sage: magma(P)
should work, but it doesn't. Here's the small fix:
http://trac.sagemath.org/ticket/16282
Cheers,
Martin
signature.asc
Description: This is a digitally signed message part.
Hi all,
currently it is a bit awkward to review a branch on trac which has many
commits. For example
http://trac.sagemath.org/ticket/15976
has quite a few commits so it seems quite daunting to review it, whereas the
actual difference to the main development branch is not that much. Locally,
On Monday 28 Apr 2014 14:57:59 François Colas wrote:
> Hi Martin,
>
> Here is two examples using multivariate quotients and extension fields
> which should be faster than computing CyclotomicField(m) or
> NumberField(cyclotomic(m), 'r') :
>
> m = 3*5*7
> pi = prime_factors(m)
> Qi = PolynomialRin
I just tried to run:
sage: m = random_prime(10^5)
sage: K. = CyclotomicField(m)
and I ran out of RAM! Doing a smaller example:
sage: m = random_prime(10^4)
sage: %prun K. = CyclotomicField(m)
puts
sage.rings.number_field.number_field_morphisms.create_embedding_from_approx
as the most expensi
Hi,
anyone up for reviewing http://trac.sagemath.org/ticket/15976 which adds an
integer lattice class (discussed here before)?
Cheers,
Martin
signature.asc
Description: This is a digitally signed message part.
Hi all,
alright, I moved the integer lattice class around:
- There's now sage.modues.free_module_integer
- this Python module contains FreeModule_submodule_with_basis_integer
- it also contains IntegerLattice which is a function imported into the
*global namespace*
- The basis is never touc
gt;
> John
>
> On 4 April 2014 11:36, Volker Braun wrote:
> > On Friday, April 4, 2014 11:19:11 AM UTC+1, Martin Albrecht wrote:
> >> existing one. However, in my case it would seem natural to improve the
> >> basis
> >> during the lifetime of an object.
&
> then the application of LLL, BKZ, or other reduction algorithms
> (the output should be a module with basis having the new reduced
> basis, as a submodule of the input module).
I am wondering about this. I appreciate this is pretty much what Sage would
normally do, e.g. functions return new ob
Hi David,
On Friday 04 Apr 2014 10:34:57 David Kohel wrote:
> Dear all,
>
> First of all, in the context of modules there should be no confusion about
> the terminology "lattice" (as opposed to a lattice poset in combinatorics).
> There is little doubt that modules with bilinear pairings are ubiq
On Thursday 03 Apr 2014 11:25:00 Ursula Whitcher wrote:
> On 4/3/2014 4:45 AM, Martin Albrecht wrote:
> > Hi Ursula,
> >
> > just to mention: there isn't much framework in that ticket, it merely
> > creates an IntegerLattice class and adds a few useful methods
y conditions. In the previous case we had (R,K) = (Z,R) but
> (Z_p,Q_p) is also used a lot theoretically.
>
> I hope that Martin does not already regret asking thew question! I
> recommend airing this in sage-algebra and sage-nt so have copied them
> in.
>
> John
>
> P
Hi all,
I have a "what colour should the bike shed be" question. At
http://trac.sagemath.org/ticket/15976
a few new classes are introduced for lattices as discrete subgroups of some
vectors spaces. The only one somewhat function is the one over the integers,
aptly called IntegerLattice. Ho
n
On Wednesday 02 Apr 2014 14:40:10 Ursula wrote:
> On Friday, March 21, 2014 7:40:09 AM UTC-5, Martin Albrecht wrote:
> > Simon gave me some hints how to integrate the new class into the category
> > framework, so the ticket now *needs review* hint hint:
> >
> > http:
Thanks, got it working!
On Sunday 30 Mar 2014 09:11:09 Volker Braun wrote:
> You might have to "make doc-clean" got get rid of stale caches when adding
> new file.
>
> The most basic UTF8 works, but its far from 100%. If you run into problems
> you have to add a workaround for the codepoint to co
Hi all,
I have two questions about the Sage reference manual:
1. How do I add a new module to it? That is, I created a new directory
lattices and I want to add that as a new reference module to the reference
manual. I did the obvious thing of adding a directory in doc/en/reference and
added an
Simon gave me some hints how to integrate the new class into the category
framework, so the ticket now *needs review* hint hint:
http://trac.sagemath.org/ticket/15976
On Wednesday 19 Mar 2014 17:38:42 Martin Albrecht wrote:
> Next update:
>
> I decided that the 2012 Sage GSoC pr
still haven't managed to contact the people responsible for that
project yet to find out what went wrong. Neither student nor mentor have
replied to my e-mail yet.
[2] I did import the diamond cutting implementation
On Sunday 16 Mar 2014 20:49:22 Martin Albrecht wrote:
> Oka
Hi all,
does *anyone* *ever* use
sage.modules.free_quadratic_module ?
"git log" isn't too promising. Nathann fixed some missing "::" in August
2013,there were some import fixes, some category fixes were applied, some
spell checking ... essentially nothing actually about this module since 2
early, there's work to be done.
Cheers,
Martin
On Thursday 13 Mar 2014 15:26:28 Burcin Erocal wrote:
> Hi Martin,
>
> On Thu, 13 Mar 2014 13:56:41 +
>
> Martin Albrecht wrote:
> > what happened to the Sage 2012 GSoC project on lattices described
> >
> >
On Sunday 16 Mar 2014 11:23:36 Volker Braun wrote:
> As far as Sage is concerned, anything that is GPLv3 compatible is fine
> (this includes LGPL).
>
> I don't understand the thought process that leads to somebody trying to
> blackmail a library into changing their license to be more liberal with
Hi all,
over at [m4ri-devel]
https://groups.google.com/forum/#!topic/m4ri-devel/dJ4fCyiZRY8
we are discussing - well, currently stating our positions - on whether M4RI
should be re-licensed to LGPL from GPL. This is because Mate Soos asked us to
consider this because it would allow him to r
oblem
Cheers,
Martin
On Friday 14 Mar 2014 16:38:55 Jori Mantysalo wrote:
> On Thu, 13 Mar 2014, Martin Albrecht wrote:
> > what happened to the Sage 2012 GSoC project on lattices described here:
> > http://gsoc-sage-lattices.blogspot.co.uk/
>
> I don't know. But anyways
Hi all,
what happened to the Sage 2012 GSoC project on lattices described here:
http://gsoc-sage-lattices.blogspot.co.uk/
It doesn't seem to have been merged (?) I could use it to give my discrete
Gaussian sampler over lattices code a home.
Cheers,
Martin
--
You received this message bec
t have come up and I missed it)
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x6532AFB4
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
signature.asc
Descript
;sage-devel" group.
> > To unsubscribe from this group and stop receiving emails from it, send an
> > email to sage-devel+unsubscr...@googlegroups.com.
> > To post to this group, send email to sage-devel@googlegroups.com.
> > Visit this group at http://groups.google.com
ing/implementing protocols, but for the kind of crypto where
Sage is probably used most - i.e. actually diving into the algorithms - I
don't think it's that useful.
Put another way: did anybody on this list ever use it? I think I may have once
briefly.
Cheers,
Martin
--
name: Ma
Hi all,
> ... especially if it's C code messing with bits :-P
It's only for lengths up to 16 but M4RI is kinda build around Gray codes, so:
https://bitbucket.org/malb/m4ri/src/49263e2d1095cd0db69b61e11c158230f94d5529/src/graycode.h?at=default
--
name: Martin Albrecht
_pgp: http:
_spkgs.html#the-file-spkg-txt
> On Tuesday, October 8, 2013 2:32:35 PM UTC+1, Martin Albrecht wrote:
> > database_symbolic_data is http://symbolicdata.org/wiki/Main_Page and it's
> > licensed under the GPL.
> >
> > On Tuesday 08 Oct 2013 04:17:51 Volker Braun wro
2:06:56 PM UTC+1, Volker Braun wrote:
> >> It has no SPKG.txt included. What about license etc? Somebody needs to
> >> write a SPKG.txt or we'll have to bump it from optional to experimental.
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&
E_LOCAL/share. Thats an easy change.
>
> On Monday, October 7, 2013 1:48:52 PM UTC+1, Martin Albrecht wrote:
> > It seems to me the database_* packages fail because there is no
> > $SAGE_ROOT/data any more. Where should databases be installed to now?
> >
> > On 7 October 20
om.
> To post to this group, send email to sage-devel@googlegroups.com.
> Visit this group at http://groups.google.com/group/sage-devel.
> For more options, visit https://groups.google.com/groups/opt_out.
>
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/loo
what the suggested workflow for
reviewing is?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x6532AFB4
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
sign
t; wrote:
> > On 8/30/13 5:53 AM, Martin Albrecht wrote:
> >> Hi all,
> >>
> >> it’s here: https://bitbucket.org/malb/sage-gb-book
> >
> > Also, you could create a project on cloud.sagemath.com and collaboratively
> > edit the textbook right ther
out solving systems of equations. A proper text on
GBs should talk about commutative algebra problems more general I guess.
All in all, it’s not necessarily well rounded and might not be the text that
the Sage community expects when it hears "Sage Book on Gröbner Bases".
Cheers,
Ma
ould illustrate how Sage lets you tie
> symbolic & numerical techniques together. The research led to a few bug
> fixes in the Mixed Integer Programming last year! :-)
>
>
> john perry
>
> On Thursday, August 29, 2013 4:18:11 AM UTC-5, Martin Albrecht wrote:
> > On
symbolic & numerical techniques together. The research led to a few bug
> fixes in the Mixed Integer Programming last year! :-)
>
>
> john perry
>
> On Thursday, August 29, 2013 4:18:11 AM UTC-5, Martin Albrecht wrote:
> > On Wednesday 28 Aug 2013 11:17:10 Rob
haps someone with a
stronger background in commutative algebra could partner up with me.
Just an idea to throw into the ring.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x6532AFB4
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D79
14 July 2013, 18:56:56
From: Hans-Gert Gräbe
To: Martin Albrecht
CC: Andreas Nareike , Ralf Hemmecke
Hi Martin,
Am 12.07.2013 16:25, schrieb Martin Albrecht:
> thanks Hans-Gert for explaining. So my understanding is this: you're
> redesigning Symbolic Data and would like Sage to
o use Sage as a backend, I am not clear yet what that
means exactly, it seems it means more than the above?
On Friday 12 Jul 2013, Hans-Gert Gräbe wrote:
> Am 11.07.2013 19:23, schrieb Martin Albrecht:
> > Hi all,
> >
> > to be honest I don't really get yet what exactl
Hi all,
to be honest I don't really get yet what exactly you are trying to achieve.
Perhaps you could write a longer description of your project (plans) for
[sage-devel] and then people there can jump in?
On Thursday 11 Jul 2013, hgg wrote:
> Hey Martin Albrecht,
>
> the main di
Hey,
I simply used symbolic data as a source for benchmarketing ideals, but my
understanding is that it's so much more. However, I'll leave Andreas to
explain that since he's the expert.
On Thursday 11 Jul 2013, Ralf Hemmecke wrote:
> On 07/11/2013 01:04 PM, Martin Albrecht
/27 which would be a great
> opportunity to exchange experiences.
>
> Please let me now if you're still working on the Sage package and if
> you're interesting in collaboration.
>
> Best regards
> Andreas Nareike
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://
trices in Sage suck (dictionary of keys).
> Sparse matrices in LELA only suck slightly less (list of lists). For fast
> computation one should implement compressed sparse row/column, I think.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search
uses an exception in this code:
> s = set()
> s.add(z)
> sstr = dumps(s)
> s2 = loads(sstr)
>
> Cheers,
> Matthew
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x6532AFB4
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7
d
> 5.10?!
Can you provide an example so I can test?
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
> 25 loops, best of 3: 34.4 ms per loop
>
> Should we just switch to (signed) long? This wastes one bit (factor of 2)
> of maximum modulus length, but at least for now we define MAX_MODULUS =
> 2**23 so this wouldn't be an issue.
Cheers,
Martin
--
name: Martin Albr
ython2.7/site-packages/sage/rings/pol
> ynomial/multi_polynomial_ideal.py", line 3840, in groebner_basis
> gb = self._groebner_basis_macaulay2(prot=prot, *args, **kwds)
> TypeError: _groebner_basis_macaulay2() got an unexpected keyword argument
> 'prot
> B) Upgrading is easier.
> C) I have a bunch of optional packages installed that I want to preserve.
> D) I have various patches to the repos (e.g. devel/sage) that I want to
> preserve.
> E) Upgrading is cool!
> F) None of the above, I do upgrade but I don't really care.
Chee
m puzzled what this is about.
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 me
Any volunteers for reviewing this?
On Saturday 23 Mar 2013, Martin Albrecht wrote:
> Hi,
>
> I've released new versions of M4RI and M4RIE and I'd appreciate if someone
> could take the time to review the relevant tickets to get these updates
> into Sage:
>
> M4
cly and loudly about your
> work managing releases!
>
> Snark on #sagemath
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: marti
16-added/
### Compilation ###
I've split up conversion.c which means I can now do this:
$ ulimit -v 196608 && make
in the M4RIE directory and M4RIE successfully built with 192MB of virtual
memory.
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=
constraint programming idea mentioned
earlier + some applications (e.g., polynomial system optimisation / solving
with noise)
(C) Lattice Cryptography
Implement things like a Learning with Errors problem instance generator and
state-of-the-art algorithms for solving it using various lattice emb
e done in a summer, and can be
> > really useful to spread sage among windows users.
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.
/sat/solvers/cryptominisat/cryptominisat.pyx.
Error installing modified sage library code.
So it's not recognised, any ideas?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_
ght still be a bottleneck.
I don't know to break those up
Any other options?
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/
t. Alternatively,
try reducing the -O level.
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
--
1 - 100 of 993 matches
Mail list logo
