On Mon, Oct 13, 2014 at 06:25:01AM -0700, Sébastien Labbé wrote:
Time to vote. What do you prefer as default directory for the ipython
notebook?
- pwd
- DOT_SAGE/notebooks_ipython/
pwd without hesitation! That's one of my main gripe about the sage
notebook. And I had trouble
Hi Dinakar,
On Mon, Oct 13, 2014 at 11:57:25PM -0700, Travis Scrimshaw wrote:
I wrote that part of the code and was assuming the user would be
checking if a root is real or imaginary. However I'm definitely for
adding this feature and having a method `is_root`. We can check
Hi sage-devel
This is to announce and get some feedback on the start of a Sage
software-development project.
This spring, Daniel Augot, Clément Pernet and I got funding from INRIA for
hiring a full-time software developer for two years to work on extending
the coding theory functionality in
KASH/KANT hasn't been maintained since about 2008 or something like that. I
think you are pretty unlikely to get a response from their email address.
However, I think I hear the voice of one of the former maintainers going
into his office just down the hall from me. I'll ask him. If he says
That is great news
AFAIK, there is still some code from last year's GSoC which is not merged,
so maybe it is a good oportunity to retake that (ticket #14973)
El miércoles, 15 de octubre de 2014 17:22:40 UTC+2, Johan S. R. Nielsen
escribió:
Hi sage-devel
This is to announce and get
In the midst reviewing ticket 16986, my reviewer came up with the following
example that fails:
R.z=PolynomialRing(QQ)
K.w=NumberField(z^3+2)
R.t=PolynomialRing(K)
L.v=K.extension(t^2+t+1)
P.x,y=ProjectiveSpace(L,1)
H=End(P)
f=H([x^3-2*y^3,v*y^3])
f.rational_preimages(P([0,1]))
However, when I
I guess caching is causing that. Creating ProjectiveSpace twice with the
same input creates two projective spaces that are equal (P==Q) but not
identical (P is not Q). Caching will look at == so if you compute
something on the second projective space then you might get back something
from the
On Wed, Oct 15, 2014 at 12:47 PM, mmarco mma...@unizar.es wrote:
That is great news
Agreed. great news!
AFAIK, there is still some code from last year's GSoC which is not merged,
so maybe it is a good oportunity to retake that (ticket #14973)
El miércoles, 15 de octubre de 2014
Hello !
Agreed. great news!
Indeed. I do not know if what you have in mind about coding theory somehow
overlaps with combinatorial designs (in particular orthogonal arrays/BIBD
:-P) but it would be nice to shake those areas of Sage anyway.
Of course, all code will go through the Trac and thus
About dependencies (again):
Working with Vincent on Combinatorial Designs (many tickets between beta
releases) taught us that it is better to 'artificially' order all tickets
linearly. Each ticket should have a successor and a predecessor, and they
should all be linearly ordered. It is tempting
On Wed, Oct 15, 2014 at 07:58:53PM +0200, Nathann Cohen wrote:
About dependencies (again):
Working with Vincent on Combinatorial Designs (many tickets between
beta releases) taught us that it is better to 'artificially' order all
tickets linearly. Each ticket should have a
This is great news! Is there any plan to implement semaphore codes in the
near future (see the book by Jean Berstel
http://www.goodreads.com/author/show/399140.Jean_Berstel, Dominique Perrin
http://www.goodreads.com/author/show/926712.Dominique_Perrin, Christophe
Reutenauer
12 matches
Mail list logo
