I would not call this an embarrassing defect. Sage is an open source project
written by volunteers that do not have an unlimited amount of time. If
something is not implemented this just means no one had the time yet to do this.
It is not to difficult to actually modify the sage source code and
Did you download a binary or install from source or even the package management
system on fedora? The report says you have Fedora 26 but sage only has fedora
25 binaries on its website. So if you downloaded that binary then that is
probably the cause.
--
You received this message because you a
It deserves a ticket, the main question is more whether the ticket should be a
bug or an enhancement. But that is something that can still be changed later.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and sto
What happens if you just do:
./configure
in the sage directory? Note that void linux is not an officially supported
platform, so it is not to surprising that there are some problems.
On Friday, 20 October 2017 01:13:35 UTC+2, Christoffer Rasmussen wrote:
>
>
> Hello I followed this guide:
> ht
Le mercredi 17 avril 2013 18:07:04 UTC+2, John H Palmieri a écrit :
>
>
>
> On Wednesday, April 17, 2013 8:58:15 AM UTC-7, Francois Maltey wrote:
>>
>> Hello everyone,
>>
>> I must declare "assume" twice. First time, I get an unevalued form.
>> After the second assume, I get the fine result :
sage: import sage.logic.propcalc as propcalc
sage: f = propcalc.formula("a^(b&c)")
sage: f.convert_cnf()
sage: f
(a|b|c)&(a|b|~c)&(a|~b|c)&(~a|~b|~c)
Le samedi 20 avril 2013 20:39:47 UTC+2, Santanu a écrit :
>
> Dear all,
> I want to convert the polynomial f into Conjunctive Normal Form (CNF)
What do you exactly want? There are multiple functions that take x*y to
-2*x-2*y-4 so it might be good to give a description of the whole function
to make this question easier to answer. One way to do what you ask is as
follows, but I'm not sure wether this is what you want!
F.=FreeAlgebra(ZZ,2
ubclassing
> FreeAlgebraElement or something else?
>
> On Monday, July 1, 2013 2:40:19 PM UTC-4, Maarten Derickx wrote:
>>
>> What do you exactly want? There are multiple functions that take x*y to
>> -2*x-2*y-4 so it might be good to give a description of the whole function
&g
It seems like your code is mostly doing easy integer operations in tight
for loops (although in your case the for loop is hidden in v.apply_map). If
you care about performance in such cases, then you should not use python,
but cython. Because everything you do in python has a small overhead, and
You should use on of the following two commands:
A1.=FFpr.quotient(ep)
A1.=PolynomialQuotientRing(FFpr,ep)
Le lundi 7 avril 2014 16:33:00 UTC+2, Irene a écrit :
>
> I am programming an example about elliptic curves but I need to define a
> couple of field extensions to make there some operatio
The way i'd expect it to work is not working as i'd expect.
sage: F.=GF(25)
sage: F2.
Display all 114 possibilities? (y or n)
sage: F2.=F.extension(x^12-a)
sage: F[b^4][b^6]
Univariate Quotient Polynomial Ring in a over Univariate Quotient Polynomial
Ring in a over Finite Field in a of size 5^2 w
Some matrix procedures also have an option which gives you the
transformation matrix.
sage: M=MatrixSpace(ZZ,4,4)
sage: A=M.random_element()
sage: A.echelon_form(transformation=True)
(
[ 101 3032] [ 85 31 4847]
[ 011 2176] [ 61 22 3475]
[ 002 5636]
I just found out that getting the transformation matrix is possible using
some more low level part of the sage interface (i.e. use the ntl wrapper
directly).
sage: B=ntl.mat_ZZ(5,5,range(25))
sage: B.LLL(return_U=True)
(2, 1250, [
[1 -2 1 0 0]
[2 -3 0 1 0]
[3 -4 0 0 1]
[1 0 0 0 0]
[-3 1 0 0 0]
Dear John,
You make a slight mistake, the unit group of Z[sqrt(2)] has rank 1, so
although you have unique factorization up to units this might still give you
a lot of different a and b satisfying the criteria.
See for example:
sage: [a^2-2*b^2 for (a,b) in [(3, 1), (5, 3), (13, 9), (27, 19),
It's mainly because a lot of things like the following should also work and
the authors didn't want to add an exception in the "special" case where all
variables have been assigned an input.
sage: f=x^5
sage: f(x=f)
x^25
sage: var("y")
y
sage: g=x*y
sage: g(x=2)
2*y
Note that the most important
According to the documentation
http://www.sagemath.org/doc/reference/sage/symbolic/units.html the unit
behave like elements from the symbolic ring, in which x-x will be replaced
by 0. I considder this a bug since clearly you can add two elements only if
the have the same unit, and the result wi
I thought a bit longer about it, and I actually think it's not really a big
bug. It think the way the units system is meant to be used is like this:
sage: var("H_l, h_c,T_a,T_l")
(H_l, h_c, T_a, T_l)
sage:
sol=solve([H_l*units.energy.calorie/units.length.centimeter^2/units.time.minute
== h_c*((
Dear Johannes,
I have a lot of trouble understanding your question. Your I is sometimes an
ideal and sometimes a ring and for me there is a huge difference between
those concepts (i.e. my rings always have an identity, and for every ring I
only one ideal with identity).
Thanks,
Maarten
--
To
On Tuesday, August 16, 2011 10:49:07 AM UTC+2, Johhannes wrote:
>
> The given example was not right at all. this one works:
> R = C[x1,x2,x3]
> I = C[x1x2x3,x1^3,x2^3,x3^3]
> this leads to G given as above:
> > let G \subset SL_3(CC) act by a e_i -> a x_i. If xi is a third primitive
> > root of uni
On Tuesday, August 16, 2011 10:46:50 AM UTC+2, Johhannes wrote:
>
> Am 16.08.2011 03:06, schrieb Nils Bruin:
> > On Aug 15, 2:54 pm, Johannes wrote:
> >> I'm sorry for unclear description of the problem.
> >> So once again, let R = C[x_1,\dots,x_n]$ be my basering.
> >> I'm looking for the group
Currently (as the reference you gave already said) it is only implemented
for 3d objects. Try the following for example:
sage: c=circle((1,1,1),1)
sage: c.translate((1,3,4))
sage: c.rotateX(2)
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group,
It seems from your message that you might want to just try out sage first
before going trough the effort of installing it. You can make a free account
on www.sagenb.org to try it out. There are quite some users on that server
so it might not be as fast as having your own installation.
For the i
By the way www.sagenb.org seems to be down now. Luckily there are more
public sage servers wich you can try is sagenb.org is down such
as http://nt.sagenb.org/
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsu
I don't think your proposal will be an enhancement. For two reasons.
1. x (x) an x*(x) have the same amount of characters.
2. currently the python and sage expressions are not white space dependant.
Your suggestion would introduce such a whitespace dependancy and will be
very unexpected for a l
This is the most efficient way you can do it in sage right now without doing
a lot of manual coding. If you want something faster you need to think about
it and write it yourself (or find someone who cares enough to do it). The
most efficient way to get this functionality in python would involve
This is already implemented in the sage i'm running (4.7.2.alpha2)
sage: P. = GF(2^10,'z')[]
sage: p = P.random_element()
sage: q = P.random_element()
sage: p.inverse_mod(q)
(z^7 + z^6 + z^5 + z^4 + z^3 + z^2 + z)*x + z^2 + z
--
To post to this group, send email to sage-support@googlegroups.com
Dear Santanu,
I noticed that you asked quite a few "easy" questions in the last few day.
It might be usefull for you to walk trough a sage tutorial (to be found at
http://www.sagemath.org/doc/tutorial/ as soon as the site is working again)
and a python tutorial (since everything you can do in
Dear Santanu,
I work myself with sage an google chrome to and it's working for me. See
below for an example. Could you please tell me which version of Chrome you
are running and on which operating system. The version of sage you are using
(or the adress of the webserver). And could you also ple
Thanks for the report. This is indeed a bug in sage. The problem is that for
some reason the algorithm in sage is asuming the moduli are coprime. If you
need the functionality now, here is an updated version of the function is
sage.
def CRT_list(v, moduli):
if not isinstance(v,list) or not
ps. if there are other sage-devs reading this. there is an easy to review (3
lines changed) patch up
at http://trac.sagemath.org/sage_trac/attachment/ticket/11750/
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+u
I followed a course once on elliptic curves. Here there was no automated
checking involved but it instead you had to share your worksheet with the
people who grade homework. That also worked quite nice. The sad thing is
that the sage server of our mathematics department
(https://sage.math.leide
Dear dkrumm,
Thanks for your very detailed bug report. I saw you also created a tract
ticket for this at http://trac.sagemath.org/sage_trac/ticket/11758
Would you also be interested in writing a patch? The other possibility is to
ask if someone here is nice enough to change the sage sourcecode a
Ok, so what I do is make sure that I have two versions of sage installed,
one is just a stable release wich I use for my regular work and one is my
development copy for development purposes. You could probably also work with
1 version, but I like to be sure that I have a working sage at all time
Is it on a OS X lion machine or is the xcode version 4? Because it is known
currently that building sage does not work well with those yet.
Search sage-devel for xcode 4 and lion or lionizing for the problems others
ran into.
--
To post to this group, send email to sage-support@googlegroups.co
On Tuesday, August 30, 2011 11:51:12 PM UTC+2, dkrumm wrote:
>
> Thanks, Maarten. I'm getting stuck when I run hg_sage.commit() . I do
> not get a text editor to open as described in the links you gave me.
> Instead, I get the same info as when I ran hg_sage.diff(), just a list
> of the change
On Wed, Aug 31, 2011 at 10:20 PM, jack wrote:
> Does this bug affect the height algorithm for points on elliptic
> curves?
>
I don't know if this height function is called by the function for
elliptic curves. The easiest way to find out is I guess to
(temporarely) put a print statement in your fi
Ok, I re asked the question on sage devel.
See https://groups.google.com/forum/#!forum/sage-devel for the most recent
status.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more o
Maybe it's time to install a newer version of sage. 4.2 is quite old now, the
latest stable release is now 4.7.1. Could you please, still also answer my
question if it is only in chrome or also in other browsers you have installed?
--
To post to this group, send email to sage-support@googlegrou
Someone else had the exact same problem on sage-devel. Maybe the solution is
here https://groups.google.com/d/topic/sage-devel/aL8b9phz3Xc/discussion
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@goog
The way to do this is probably to change the CFLAGS that are exported in the
pari install script. You find all pari related stuff in the pari spkg, this
is located in $SAGE_ROOT/spkg/standard . Note that this is a compressed file
so you have to untar it first.
On http://www.sagemath.org/doc/dev
I have OS X 10.6.8 also but I don't have the same version of sage installed
currently as you (I have sage 4.7.2.alpha2 and 4.6.1) and I don't seem to be
able to replicate your error in both the older and the newer install. I
don't have firefox so could you please try it from the command line (i.
On Fri, Sep 2, 2011 at 5:25 AM, Santanu Sarkar
wrote:
> For mozilla firefox, it is perfect. I dont known about other browsers.
>
Then it's probably not a sage issue since your chrome version is
really outdated. You say you have 5.0.375.70 but the latest stable
release is already version 13.
--
T
>From the location of your sage install
~/Documents/sage-4.7.1-linux-32bit-ubuntu_10.04_lts-
i686-Linux
I see you downloaded a prebuild binairy, I guess what's going wrong is that
this binary was compiled in such a way that it's not compatible with your
system. This
post https://groups.google
I just looked at the code of the script and it should end as long as there
are no sage processes running anymore. The file itself is a python script
wich contains a lot of print statements for debugging wich are currently
commented out. For more info on what goes wrong you can uncomment these
p
I think it is consequent. list(factor(n)) just gives a list of tuples (p,e)
where p is a prime dividing n and e is it's exponent. Since there are no
primes dividing 1 the list is empty.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send em
In the installation
guide
http://www.sagemath.org/doc/installation/source.html#environment-variables
it is mentioned that for OS X 10.6 and greater you don't need to set
SAGE64=yes to get a 64 bit install. Do you get the same error without the
SAGE64=yes? I've managed to build 4.7.2.alpha2 on
What solution is best for you really depends on how much you expect sage
will get used. I definitly advise you to have your own sage notebook server
running somewhere. And it would be best if that place was accesible from the
WWW so student can also use it from home.
(3,4) It would not be a lar
z.domain() fails because [0,1] is not a function but a list try:
z.domain
z.operation() fails because operation expects two arguments but it gets none
try:
z.operation(4,3)
display() fails because it calls failing functions
--
To post to this group, send email to sage-support@googlegroups.com
Note if you really want to do the things you want to do in the right way you
have to learn about categories, parents, elements and the coercion model in
sage.
see http://www.sagemath.org/doc/reference/sage/categories/primer.html and
http://www.sagemath.org/doc/reference/sage/structure/coerce.ht
>From the errors it looks like the installation did work, but starting the
resulting sage didn't work. Can you confirm this by telling what was the
command you executed to get the errors.
It looks like a problem with circular imports somewhere in numpy (a python
package used by sage), but those
rt of the documentation?
-- Forwarded message --
From: jianrong
Date: Sun, Sep 25, 2011 at 5:26 PM
Subject: Re: Sage install errors.
To: Maarten Derickx
Thank you very much. The command I used is make. I will try again
using your suggestions.
On 9月25日, 上午6时03分, Maarten Derickx
wrot
You should not neet to run installing as root. The error seems to be caused
by the fact that your C preprosessor as located in /lib/cpp is behaving
different from what sage expects. Can you show what is in config.log file?
--
To post to this group, send email to sage-support@googlegroups.com
To
It seems that the error is that on your system you cannot include the c
header file limits.h . But this is a file which is part of the C standard
library and hence including it should work on any system with gcc installed.
>From this I conclude that gcc shipped with your linux distro (pradus lin
Just for the record, this problem is solved.
Begin forwarded message:
*From:* jianrong li
*Date:* September 26, 2011 0:20:57 GMT+02:00
*To:* Maarten Derickx
*Subject:* *Re: Sage install errors.*
Thank you very much. I have installed successfully.
2011/9/25 Maarten Derickx
> The prebu
Phi(z) since by in your example the reduction of z will be primitive by
definition.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups
Mod(B*x, M) doesn't return an integer but an element of Integers(M) = the ring
of integers modulo M. So the differences you see are because B is a normal
integer so the subtractions involving B and M are just integer subtractions,
but the substractions involing x and M are substractions in Inte
what happens if you somewhere create a file sagetest.sage with the contents:
print "hello world"
and try to run that file both with absolute and relative path?
Since the core of the error seems to be not related to sagetex at all.
--
To post to this group, send email to sage-support@googlegrou
Have you tried running notebook.setup() from within sage as mentioned
on http://www.sagemath.org/doc/reference/sagenb/notebook/notebook_object.html
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@google
In sage the types are not that important (it is just an implementation
detail), but the parent of an object is since that says what the
mathematical meaning of an object is. Try:
q=p.parent()(q)
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this grou
Dear Juan Grados,
I don't think people have forgotten it, but merely not answering since you
are asking in the wrong place. This is the sage mailinglist not the mpi4py one
and the problems you are experiencing are problems with getting mpi4py
working and not sage.
Also your large amount of me
Why don't you just work with the quotientring of a polynmial ring?
sage: Rx.=RR[]
sage: K.=Rx.quo(x^6+1)
sage: j=a^4
sage: i=a^3
sage: j^3
1.00
sage: i^2
-1.00
sage: (1+j+j^2) * j
a^4 - a^2 + 1.00
sage: (1+j+j^2)
a^4 - a^2 + 1.00
--
To po
It all depends on how this f is created/defined. Can you give an explicit
example?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.g
I suggest that you don't word with symbolic variables then, but make the
fraction field of a polynomial ring with enough variables to do the
calculations in, in this case c.numerator() and c.denominator() works also for
the intermediate results. An other thing you could do is
CC['x'](c).denomin
Of course the solutions above here will work. But an important thing that
also should be mentioned is that sage is python+ a lot of mathematics+ some
additional syntax. The question you asked is possible in almost every basic
programming language and also very easily possible using python. You s
I guess things work different from system to system then. Because when I
symlink to it, I also have to change the file if I want to execute it from the
symlink location.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-su
I guess things work different from system to system then. Because when I
symlink to it, I also have to change the file if I want to execute it from the
symlink location.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-su
If you type:
Matrix?
You will see in the documentation a lot of different ways to construct a
matrix. Is this good enough?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more opt
Ah, then this issue will hopefully be fixed with changing the python in
sage to 2.7. There is already work being done on that issue
at http://trac.sagemath.org/sage_trac/ticket/9958 . You can also find a new
spkg there, so with that spkg you might be able to build from source. But
the doctest w
>
>
> What's the ETA on that? Is there a patch I could apply in the
> meantime?
Sage does not really work with ETA's, everything depends if there is
someone willing to work on a specific issue voluntarily. The patches you
could apply are all mentioned on that ticket, you will also need the
There is already a ticker for this with a patch wich fixes the problem at:
http://trac.sagemath.org/sage_trac/ticket/11758 but that ticket still needs
some work because the doctests are not ajusted jet to the new height
function.
--
To post to this group, send email to sage-support@googlegroup
And apparently the message I gave was useless, since I indeed asumed what
John explained. But this is not true!
The addition of the patch at the ticket did not change anything to the
examples above (I got exactly the same answers as you in the case with the
negative height). And the addition of
This timeout error is not bad. It just means that your tablet cannot
complete a certain test within the time limit set for the tests. Since your
tablet is probably slower than a normal desktop pc this is not that bad.
There is already a ticket (http://trac.sagemath.org/sage_trac/ticket/12023)
w
Well there is of course the possibility to use only ascii (but I guess you
already thought of that), the other solution would involve hacking the sage
source code, since matplotlib has unicode support [1] this should be
posssible. A third solution is to use matplotlib directly, from sage you
ca
Dear Vasudev,
Sage ships it's own version of python. And this python doesn't use the
system python. When you installed matplotlib using yum, yum took care of
all dependency's for you. To get other python packages in sage you should
do:
sage -sh #this starts up a shell with all environment va
Dear Vlnay,
You can at least work around the problem by first downloading the spkg file
and then do:
sage -i ""
The error you get means that the command UrllibProxy in the file
/home/vinay/Sage/sage-4.7.2-linux-32bit-ubuntu_10.04_lts-
i686-Linux/local/bin/sage-download_package
does not exist.
Good to here your problem got solved. Sadly enough sage does not allow easy
uninstallation of spkg's. To do this you would have to manually undo
everything performed by the spkg-install script wich is in the spkg file.
--
To post to this group, send email to sage-support@googlegroups.com
To uns
Thanks for the report, I see the worksheet on my account as well. It looks
like someone just shared a worksheet with all users (something wich is very
easy to do). So I should not worry about it to much until someone her can
tell you more.
It would be a good thing for us to see if this is reall
It seems that you installed sklearn in the wrong way. To install sklearn for
usage with sage do:
sage -sh
To start a shell wich is configered so that all sage directories and binaries
and the sage python are in your path. And then do whatever the sklearn
documentation sais you should do.
We c
It seems that you installed sklearn in the wrong way. To install sklearn for
usage with sage do:
sage -sh
To start a shell wich is configered so that all sage directories and binaries
and the sage python are in your path. And then do whatever the sklearn
documentation sais you should do.
We c
Note that: sum(a,[]) gets incredibly slow when a contains a lot of lists (it's
runtime complexity is kwadratic in the number of lists in a). So it's better to
do:
l=[]
for i in A:
l.extend(i)
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this grou
Dear Jim,
The problem is that kQ.gens()[0] is not an element of the kQ.monoid() as is
required as said in the documentation and the examples. To fix your problem:
sage: kQ = FreeAlgebra(QQ ,2 , 'x')
sage: gens=kQ.monoid().gens()
sage: mons = [gens[0], gens[1], gens[0]*gens[1]]
sage: mats = [Mat
Well the way I first tried is as follows:
age: F.=GF(2)[]
sage: G.=F.quotient(x^6 + x^4 + x^2 + x + 1)
sage: a.multiplicative_order()
---
NotImplementedError Traceback (most recent call last)
But it giv
If you look in the source code slightly before where the class
UniqueFactory is defined you will see the following:
from sage_object cimport SageObject
cdef sage_version
from sage.version import version as sage_version
sage_version = sage_version.split('.')
for i in range(len(sage_version)):
You might try this:
http://www.koders.com/info.aspx?c=ProjectInfo&pid=8C6XCAPW8UCXPHS5SE2SQRYQBC&s=cdef%3areal
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit th
Dear All,
I've setup my own sage server (running sage 4.8 on debian) with two
accounts. One called "sagerunner" wich actually runs the notebook and one
called sageslave wich runs the calculations. To be more precise notebook is
started with the argument server_pool=["sageslave@localhost"]. But
Le mercredi 28 mars 2012 23:19:55 UTC+2, Maarten Derickx a écrit :
>
> Dear All,
>
> I've setup my own sage server (running sage 4.8 on debian) with two
> accounts. One called "sagerunner" wich actually runs the notebook and one
> called sageslave wich runs the
Actually the 404 error sais that you alreade got past the firewall and have
reached the server so the trouble should be somewhere else indeed.
Does the 404 error say more (i.e. does it say what is not found?). A
screenshot might be usefull.
p.s. I assume that you don't already have your own webs
I think you should make it an spkg because that is how people using sage expect
to install it.
Note that the install script in an spkg can contain arbitrary bash code so it
can do everything you want it to.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe fro
In your setup everything worked ok. You just defined a function called
hello. The function was never executed so you didn't see anything.
To execute the function try the following:
hello()
Considdering you are new with sage I suggest first learn how to use python
(and don't use the %cython). On
I'll give you a small example so hopefully you can figure out the rest.
The following code first defines the function custom_divide and then prints all
possible values of that function together with the input. You could also add
the values to a list or a set to process them later.
def custom_d
Yes the last few lines should read:
for r in p:
output.writerow(r)
del o
Python is indentation sensitive and uses it to determine where the for loop
stops.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+u
Does executing:
import foo
give what you want or is your problem different?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.
Dear Arthur,
In the other thread I gave a quite explicit example how to do such a thing
only with less complicated formula's. All the techniques needed to solve
the problem are given there. What problems are you running in to when
trying to generalize my example to using more complicated formul
maybe it will be clearer, I hope.
>
> Regards,
> Arthur
>
>
> W dniu wtorek, 10 kwietnia 2012 19:20:15 UTC+2 użytkownik Maarten Derickx
> napisał:
>>
>> Dear Arthur,
>>
>> In the other thread I gave a quite explicit example how to do such a
>> th
I don't know the details of the setup on our department, but I also run my
own server at sage.mderickx.nl .
I use a combination of 3) and 5) on a debian system. And it has been
running very stable (no problems since I configured the server about half a
year ago). The reason why I also have apac
Le mardi 31 juillet 2012 14:20:14 UTC+2, jori.ma...@uta.fi a écrit :
>
> I am setting up Sage 5.1 on Ubuntu 12.04.
>
> I have done
>
> sage -sh
> $ easy_install python-ldap
>
> and
>
> cd $SAGE_ROOT/devel
> git clone -b ldap https://github.com/rmartinjak/sagenb.git sagenb-ldap
> ln -s sage
Le mardi 31 juillet 2012 14:20:14 UTC+2, jori.ma...@uta.fi a écrit :
>
> I am setting up Sage 5.1 on Ubuntu 12.04.
>
> I have done
>
> sage -sh
> $ easy_install python-ldap
>
> and
>
> cd $SAGE_ROOT/devel
> git clone -b ldap https://github.com/rmartinjak/sagenb.git sagenb-ldap
> ln -s sage
Le mardi 4 septembre 2012 10:40:24 UTC+2, sha2nk a écrit :
>
> k=GF(2^11);
> K=GF(2^33)
>
> How to see K as a vector space over filed k ? How to form its basis ?
> How to construct tower of field extensions ?
>
Hi, Sadly enough non of these three things are implemented in sage yet for
finite fie
Why don't you ask them to install the sage server on a different machine,
and let other people acces it via the notebook? In Leiden they have also
taken this approach and it works fine (see sage.math.leidenuniv.nl).
Thanks Maarten
Le jeudi 30 août 2012 04:34:14 UTC+2, Luis Garcia-Puente a écrit
It seems that this is exactly the same problem of something I fixed for
general matrix construction earlier on. See:
http://trac.sagemath.org/sage_trac/ticket/10628
The problem is that the complexity of: sum(some_list_of_lists,[]) is
something like n^2*m where n = len(some_list_of_lists) and m
1 - 100 of 103 matches
Mail list logo
