2008/4/21 Franco Saliola [EMAIL PROTECTED]:
Hello everyone.
I'm sorry to reply in so late on this, things have been busy and I've
not been keeping up with the list lately.
As for my slides: all included examples do work in Sage or Sage++,
where Sage++ denotes a future version of
This would surely be easy to implement for vectors: if v and w have
respective entries v[i] for i in range(m), and w[j] for j in range(n)
then v.tensor_product(w) would have m*n entries v[i]*w[j] index by k
in range(m*n) where k=n*i+j. The only issue is whether i moves faster
than j instead
I think this is because the underlying computer algebra system Sage
uses for univariate polynomial rings and multivariate rings are
completely different, so support different operations.
Someone else might be able to suggest a work-round.
John
2008/4/24 UAT [EMAIL PROTECTED]:
For some
Is this actually a bug? It would certainly wrong if the test being
performed was isomorphism rather than equality, but I think it is
actually reasonable for two finite abelian groups to only be reported
as equal when they are presented the same way.
John Cremona
2008/5/7 William Stein [EMAIL
that are considered equal:
AbelianGroup([6]) == AbelianGroup([1,6])
True
On May 8, 10:16 am, John Cremona [EMAIL PROTECTED] wrote:
Is this actually a bug? It would certainly wrong if the test being
performed was isomorphism rather than equality, but I think it is
actually
This works instead:
parametric_plot([exp(-t)*e for e in evec],1,2)
where it's fine to replace evec by [1,2] (no need for vector([1,2]).
I think the problem is that exp(-t) * evec is a *vector* of functions
when a *list* of function is what the plot wants.
John
2008/5/8 Dan Drake [EMAIL
() for information.|
--
sage: x,y=var(x,y)
sage: x,y=var('x,y')
John Cremona
2008/5/8 Babai [EMAIL PROTECTED]:
x,y=var(x,y), this syntax ran smooth the first time, but when I ran
it second time...
This error shows,
x,y
- getting things like scipy/numpy to
play nice with them, for example, seems tough.
-M. Hampton
On May 8, 8:06 am, Jason Grout [EMAIL PROTECTED] wrote:
John Cremona wrote:
This works instead:
parametric_plot([exp(-t)*e for e in evec],1,2)
where it's fine to replace
That's what it shows for a new file added to the repository, so the
diff it shows is the diff between the new file and nothing, i.e.
/dev/null. I think!
John
2008/5/9 David Joyner [EMAIL PROTECTED]:
Hi:
Does /dev/null, around 40-50 lines down in
Didier, I am sure you are right but I thought it best to deal with one
matter at a time! From Rose's posting it looked as if she was just
trying to count instances in a list, while Tuples is a much more
complicated function.
John
2008/5/9 didier deshommes [EMAIL PROTECTED]:
On Fri, May 9,
Rose,
S'il est necessaire, il y a des gens qui lit sage-support qui
comprennent le francais et qui peuvent peut-etre explique des choses
en francais (sans accents)!
John
2008/5/11 Rose [EMAIL PROTECTED]:
On 10 mai, 23:33, Jason Grout [EMAIL PROTECTED] wrote:
Could you post the code that
().sqrt()
6.40312423743285
I hope this helps.
John Cremona
2008/5/25 Rose [EMAIL PROTECTED]:
Hi,
I use the function abs to know the distance between two
ComplexNumbers. Sometimes it returns a RealNumber, but sometimes it
returns a SymbolicComposition. When it returns SymbolicComposition, I
can
It does rather depend on what sort of field you mean!
When K is a number field, of course K*/K*^2 is obviously infinte, but
Magma's function pSelmerGroup() (with p=2) allows you to define finite
subgroups of it unramified outside finite sets of primes. This is
heavily used in descent on
Finite fields would be rather easy -- especially in characteristic 2!
John
2008/5/28 [EMAIL PROTECTED] [EMAIL PROTECTED]:
Particularly number fields. But if this could be done for more general
fields then even better:)
Cheers
On May 28, 8:43 pm, William Stein [EMAIL PROTECTED] wrote:
Well, everything you need for that is (as far as I know) in Magma.
If something you need is not, ask Magma!
John
2008/5/28 [EMAIL PROTECTED] [EMAIL PROTECTED]:
Yes this is descent i'm looking to use it in.
Many thanks,
Frank
On May 28, 9:00 pm, John Cremona [EMAIL PROTECTED] wrote
+ a^3 +
a^2 + 1)*x0bar*x1bar*x2bar*x3bar*x6bar*x7bar + (a^6 + a^4 +
a^2)*x0bar*x1bar*x2bar*x4bar*x6bar*x7bar +
(a^6)*x0bar*x1bar*x3bar*x4bar*x6bar*x7bar + (a^7 + a +
1)*x0bar*x2bar*x3bar*x4bar*x6bar*x7bar + (a^6 +
a^3)*x1bar*x2bar*x3bar*x4bar*x6bar*x7bar +
John Cremona
2008/5/28 David Joyner [EMAIL
This behavour (lisp.run processes not getting killed on exit) is still
being trac'ed at #2518. It still happens to me on 3.0.2 on a 64-bit
Suse linux system.
John
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 6:56 AM, Shing Hing Man [EMAIL PROTECTED] wrote:
Thanks for
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 7:09 AM, John Cremona [EMAIL PROTECTED] wrote:
This behavour (lisp.run processes not getting killed on exit) is still
being trac'ed at #2518. It still happens to me on 3.0.2 on a 64-bit
Suse linux system.
I've fixed
Sorry for delay...
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 9:47 AM, John Cremona [EMAIL PROTECTED] wrote:
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 7:09 AM, John Cremona [EMAIL PROTECTED] wrote:
This behavour (lisp.run processes
I would be happy to try this out with a patched version which has some
debugging output.
John
2008/5/31 mabshoff [EMAIL PROTECTED]:
Hi,
I *think* the problem is in the sage-cleaner, specifically the
following code:
def kill_spawned_jobs(file, parent_pid):
#print killing %s's spawned
William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 11:04 AM, John Cremona [EMAIL PROTECTED] wrote:
Sorry for delay...
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May 31, 2008 at 9:47 AM, John Cremona [EMAIL PROTECTED] wrote:
2008/5/31 William Stein [EMAIL PROTECTED]:
On Sat, May
It seems that what Dan Bump's instructions did not specify is what
properties the class assigned to ._combinatorial_class must have.
And it needs something which PermutationGroupElement does not have.
Does that help?
John
2008/6/28 David Joyner [EMAIL PROTECTED]:
Hi:
Since there are some
to from_cycles where the
first parameter n is computed as the sum of the lengths of the cycles
input instead of the maximum integer input.
John Cremona
2008/7/3 Pierre [EMAIL PROTECTED]:
hi all,
I'm confused with the cycle notation for permutations (bug ?)
While the following works:
sage
2008/7/4 William Stein [EMAIL PROTECTED]:
On Thu, Jul 3, 2008 at 10:50 AM, John Cremona [EMAIL PROTECTED] wrote:
I would still say that this is a bug, since the following does work:
sage: Permutation('(1)(2)(3)(4,5)')
[1, 2, 3, 5, 4]
and the docstring says the Permutation can be given
2008/7/11 David Joyner [EMAIL PROTECTED]:
Hi:
The following gives a patch not under root abort error which I was wondering
if anyone could explain.
(1) I create a clone
(2) download a patch from trac (by clicking on the link at the bottom
of the patch
page and selecting download)
(3)
. But one thing I am
confident about is that surds are algebraic!
This is not strictly relevant to the point made by Brendan, but please
can we have this put into the FAQ without using the word surd? You
could change surd value to symbolic value here.
John Cremona
2008/7/11 Jason Grout [EMAIL
That looks to me like a bug caused by an underlying bug in maxima.
maxima: limit(floor(x),x,0,`minus')
does not finish,
while
maxima: limit(floor(x),x,0)
0
John Cremona
2008/7/11 John Perry [EMAIL PROTECTED]:
Hello,
I'm quite sure this is a bug, but I can't find a ticket for it.
sage
2008/7/19 William Stein [EMAIL PROTECTED]:
On Sat, Jul 19, 2008 at 10:29 AM, doctorantinfo [EMAIL PROTECTED] wrote:
Hello
I wrote this program in SAGE online, but i failed to find error, I
need help
def gcd_multipliers(x, alpha, i):
fac=factor(alpha)
projections=[]
for p,v in fac:
It looks as if the exponent is being rounded:
sage: u^(3/2)
u
sage: u^(101/100)
u
sage: u^(99/100)
1
John
2008/7/19 Andrey Novoseltsev [EMAIL PROTECTED]:
Hello,
I need to substitute some variable in a polynomial ring with a
fractional power of another one. I know that the result still
David's solution is very clever -- but this is simpler:
'('+latex(f)+')('+latex(g)+')'
Admittedly rather inelegent!
John
2008/8/23 Shing Hing Man [EMAIL PROTECTED]:
Hi,
Consider polynomials
f = 1 +t + 2*t^2
g=1+t
over R.t = PolynomialRing(GF(7));
How to get the Latex expression
I already had a quick look at this when Hakan first posted, but came
to no instant conclusion -- except that there are quite a few
functions in the Sage-pari interface where precision is impossible or
difficult to set as one would hope.
For example:
sage: P=EllipticCurve('37a1').gens()[0];
You are definitely right. The problem lies (as far as I can see) in
sage.schemes.generic in the __init__ funtion of class
SchemeMorphism_on_points_projective_space. (I only found this out by
tring to construct a morphism from P^1 to P^1 using 3 polynomials,
which did raise an error in this very
This is now #3964.
John
2008/8/27 John Cremona [EMAIL PROTECTED]:
You are definitely right. The problem lies (as far as I can see) in
sage.schemes.generic in the __init__ funtion of class
SchemeMorphism_on_points_projective_space. (I only found this out by
tring to construct a morphism
(if
people agree with me that i is a bug).
John Cremona
2008/8/28 Stan Schymanski [EMAIL PROTECTED]:
Dear all,
I use pylab for plotting, which requires creating lists of x and y
values. Now, in order to manipulate the lists, I would like to perform
simple operations on them, like for example
That's odd, your script only takes a few seconds for me.
By the way, if this is a sage script the you don't need the Integer()
wrappers, and you also don't need the semicolons.
2008/8/31 vakaras [EMAIL PROTECTED]:
My code after changes:
I = CDF.gen(0);
n = Integer(200);
x = Integer(200);
Putting == between two symbol expressions creates a symbolic equation,
not a test for equality. There is there fore a difference between
these:
sage: 3 == 3
True
sage: x == x
x == x
This behaviour of == is (I think) unique to the symbolic ring in Sage.
You can test for equality like this:
: bool(eqn)
True
sage: bool(exp(pi*I)==-1)
True
John
JM
On Sep 2, 11:38 am, John H Palmieri [EMAIL PROTECTED] wrote:
On Sep 2, 8:19 am, John Cremona [EMAIL PROTECTED] wrote:
Putting == between two symbol expressions creates a symbolic equation,
not a test for equality
You have
E.lift_x(x0) which gives a point with x-coord x0 if there is one (else
raises an error), or E.lift_x(x0,all=True) which gives a list of 0, 1
or 2 points with x-coord x0, or E.is_x_coord(x0).
JEC
2008/9/3 Maike [EMAIL PROTECTED]:
John,
Hello again :-) While you're working on more
For example (using your notation)
sage: a=3; b=5
sage: E = EllipticCurve(RR,[a,b])
sage: E
Elliptic Curve defined by y^2 = x^3 + 3.00*x +
5.00 over Real Field with 53 bits of precision
sage: xP=1
sage: P=E.lift_x(xP)
sage: P
(1.00 : 3.00 :
it would be good to have implemented in
Sage. Feel free to do so and submit a patch!
John Cremona
2008/9/3 Jannick Asmus [EMAIL PROTECTED]:
Dear All,
suppose that K is a number field and U the group of units in the maximal
order of K. Then the rank r of U, i.e. the rank r of the free group U_f
. ( z!=RR(infinity) might
also work, but using z.is-infinity() is curely better.
Tell us if this works.
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
reference.)
I think this is better:
http://sagemath.org/doc/ref/module-sage.rings.real-mpfr.html
since RDF (double precision reals) is deprecated. Again, look for is_infinity.
John Cremona
D
--~--~-~--~~~---~--~~
To post to this group, send email to sage
2008/9/4 Jason Merrill [EMAIL PROTECTED]:
On Sep 4, 7:23 am, John Cremona [EMAIL PROTECTED] wrote:
2008/9/4 David Philp [EMAIL PROTECTED]:
I think this is better:
http://sagemath.org/doc/ref/module-sage.rings.real-mpfr.html
since RDF (double precision reals) is deprecated. Again, look
Excellent. It should be cross-referenced from the docstring to
complex_embeddings(), real_embeddings() and also possibly
embeddings().
I also notice that places() gives maps to RIF, CIF while
{real,complex}_embeddings give maps to RealField, ComplexField. I
don't have a feel for which is
The symbolic ring is not the most obvious place to do arithmetic
operations such as reducing one thing modulo another: that's a job for
a polynomial ring:
sage: R.x,y=QQ[]
sage: x%y
x
sage: y%x
y
sage: def proc(a,b): return a%b
:
sage: proc(x,y)
x
sage: proc(y,x)
y
John
2008/9/7 Rolandb
This works:
plot(lambda t:bessel_J(1, t), (1, 10))
so (1) a one-variable function is reequired, and the lambda
construction creates such a function from the2-variable bessel_J, and
(2) the range is a tuple (xmin,xmax) .
John Cremona
2008/9/11 Dan Drake [EMAIL PROTECTED]:
Certainly I must
I agree entirely. Users should not have to have to think exactly how
about polylog() and bessel_J() are defined.
John
2008/9/11 Jason Merrill [EMAIL PROTECTED]:
On Sep 11, 9:07 am, John Cremona [EMAIL PROTECTED] wrote:
This works:
plot(lambda t:bessel_J(1, t), (1, 10))
so (1) a one
be
extremely useful to have two independent methods implemented
independently!
John Cremona
2008/9/12 William Stein [EMAIL PROTECTED]:
Hi Gokhan,
John Cremona is working on adding support for computing
S-integral points on elliptic curves in Sage. I've cc'd
your email to him (and to sage-support
2008/9/18 John H Palmieri [EMAIL PROTECTED]:
On Sep 17, 9:09 pm, William Stein [EMAIL PROTECTED] wrote:
On Wed, Sep 17, 2008 at 8:59 PM, John H Palmieri [EMAIL PROTECTED] wrote:
sage: is_FractionField(FractionField(ZZ))
False
Oy. This seems to be intentional: there is a doctest very
This looks a bit like an additive version of what we already do with
factorizations. I wonder if you could clever use the factorization
class for it?
John
PS I didn't really mean to suggest that you were stuck on the
mathematics of this!
2008/9/18 John H Palmieri [EMAIL PROTECTED]:
On Sep
: c.factor()
2^22 * 3^10 * 5^6 * 7^3 * 11^2 * 13 * 17 * 19 * 23
(which would be helpful to people who might know know this meaning of
valuation, standard in number theory), and even perhaps
sage: list(c.factor())
[(2, 22), (3, 10), (5, 6), (7, 3), (11, 2), (13, 1), (17, 1), (19, 1), (23, 1)]
John
2.00]
[3.00 4.00]]
To add the entries of a vector:
sage: v=vector(range(100))
sage: sum(v)
4950
I'll leave row sums of a matrix as an exercise!
John Cremona
2008/9/23 aniura [EMAIL PROTECTED]:
hi,
I wanted to know if there is a way to work in Sage
2008/9/23 Simon King [EMAIL PROTECTED]:
On Sep 23, 3:31 pm, John Cremona [EMAIL PROTECTED] wrote:
The rest of your query is hard to interpret. To create a list of
equal elements, say a list of 5 copies of the matrix m, do this:
sage: [m]*5
But this would not create a list of 5 *copies
later.
However I'm still not sure why the original display ends 8? and not
7?. The ? notatation was introduced quite recently, so I am not sure
whether this is a feature or a bug.
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support
2008/9/23 John Cremona [EMAIL PROTECTED]:
2008/9/23 pong [EMAIL PROTECTED]:
I tried
sage: A=matrix([[1,1],[2,3]])
sage: A.eigenvalues()
[0.2679491924311228?, 3.732050807568878?]
My question is why the last digit before ? in 0.2679491924311228? is
'8'? Shouldn't it be 7 according
().complex_embeddings())
2
You have complete control over precision:
sage: emb = B.parent().complex_embeddings(prec=200)[0]
sage: emb(B)
-6.50 +
11.258330249197702407928401219788170385128234149767474082363*I
John Cremona
2008/9/24 Raouf [EMAIL PROTECTED
function
RightTransversal.
John Cremona
2008/9/24 Carlo Hamalainen [EMAIL PROTECTED]:
On Wed, Sep 24, 2008 at 7:29 PM, Rob Beezer [EMAIL PROTECTED] wrote:
A homework exercise for my students asks them to find all subgroups of
S_4, which should be a very instructive exercise, even if a bit
, defines a as the residue of 520622 in that ring, and then
exponentiates.
John Cremona
2008/9/25 Mikemak27 [EMAIL PROTECTED]:
I am brand new to this. I was wondering how to calculate mods while in
the sage notebook. I need to calculate 520622^430085 mod 998171. Does
anyone know how to type
algorithm available. Some of the finite
field implementations may well have better implementations.
John Cremona (author of most of generic.py)
On Oct 2, 8:21 am, David Møller Hansen [EMAIL PROTECTED] wrote:
I want to know how SAGE finds the discrete logarithm problem in finite
fields and in EC
On Oct 7, 8:45 am, Mike Hansen [EMAIL PROTECTED] wrote:
Hello,
On Mon, Oct 6, 2008 at 6:50 PM, SK [EMAIL PROTECTED] wrote:
Now, I try and compute X * (X^(-1)). Instead of getting an identity
matrix, I get a complicated matrix in x, y and z. Thinking that the
^ may be the issue, I tried
: x4 = E4[0][1]
sage: x3 = E4[2][0]
Now what we need is a way of constructing a number field from a finite
list of elements of QQbar, which is not implemented. But the above is
a start.
I will make a patch to correct the two things mentioned at the top
(without which this code will not work).
John
Dear Tipoy,
This has been on my to-do list for some time -- it is trac ticket
#360! So it is not currently implemented, sorry.
John Cremona
On Sep 28, 11:45 pm, Tipoy mvaldett...@gmail.com wrote:
Hello: I want to know how to calculate de height matrix of some points
on an elliptic curve
See below
On 24 Sep, 13:13, John Cremona john.crem...@gmail.com wrote:
Here's a way, using QQbar. To get this to work I had to (1) add a
trivial function is_square() for elements of QQbar (it did not exist
but was required i nthe code for constructing points), and also
correct a typo
On 1 Oct, 17:05, John Cremona john.crem...@gmail.com wrote:
-- I was expecting full set of roots here. Can anyone see what's
wrong?
What is wrong is a bug in Sage's code for factoring polynomials over
number fields (which is used to find roots of polynomials over number
fields). This has
in this example is the
same).
I think that this thread would belong better on sage-nt.
John Cremona
On Oct 27, 1:17 pm, adam mohamed adam.hariv...@googlemail.com wrote:
I would like an exact result, and the lattice I am dealing with is just the
ring of integers. Say for an element in my field, I
to it from off campus, I suspect that you are
doing some of the things which I should have been doing.
John Cremona
On Oct 28, 4:16 am, Mike Hansen mhan...@gmail.com wrote:
On Wed, Oct 28, 2009 at 11:10 AM, David david.r.guich...@gmail.com wrote:
I'm getting the picture now I think. I need a user
I only discovered the -startup
option 5 minutes ago and have ignored most of its output...
John Cremona
On Oct 29, 10:57 pm, William Stein wst...@gmail.com wrote:
On Thu, Oct 29, 2009 at 3:44 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Oct 29, 2009, at 3:39 PM, William
is 0 to 10^4 decimals in that example!)
# Ugly
sage: m == n
True
I think this is a coercion issue. I agree taht the result is not
mathematically nice at all:
sage: m==n
True
sage: m.rank(), n.rank()
(2, 3)
John Cremona
--~--~-~--~~~---~--~~
To post
of certtool when Sage is
built.
John Cremona
On 16 Nov, 09:45, marc.burw...@googlemail.com
philipp.kl...@gmail.com wrote:
In my case just waiting for about 10 minutes solved the problem as the
entropy on the computer where I started sage was too low.
greetings marc
On Nov 12, 3:22 am
On Nov 19, 4:26 pm, William Stein wst...@gmail.com wrote:
On Thu, Nov 19, 2009 at 3:33 AM, John Cremona john.crem...@gmail.com wrote:
I am having exactly the same problem as the original poster. The
machine runs 64-bit ubuntu (Linux version 2.6.28-13-generic
(bui...@yellow) (gcc version
works fine while from
sage it does not.
John
On Nov 19, 4:26 pm, William Stein wst...@gmail.com wrote:
On Thu, Nov 19, 2009 at 3:33 AM, John Cremona john.crem...@gmail.com
wrote:
I am having exactly the same problem as the original poster. The
machine runs 64-bit ubuntu (Linux version
improvements should be made (in
this case).
John Cremona
On Nov 20, 9:00 pm, finotti luis.fino...@gmail.com wrote:
Dear Simon,
On Nov 20, 2:19 pm, Simon King simon.k...@nuigalway.ie wrote:
Hi Luis!
First, I would produce a clone of Sage, in order to not destroy your
installation by mistake
to
your problem to find all the integer points on the W. model and map
them back.
I do not know of any implementation anywhere which applies to more
general models.
John Cremona
On Dec 7, 12:53 pm, Jaakko Seppälä jaakko.j.sepp...@gmail.com wrote:
Hello again!
Is that method general? I tried now
the documentation should be corrected -- the
documentation for running servers is all over the place and extremely
confusing).
John Cremona
--
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
in volume 1 of Henri Cohen's book
Number Theory (Vol 1: Tools and Diophantine Equations), GTM 239.
John Cremona
On Dec 8, 2:10 am, Yann yannlaiglecha...@gmail.com wrote:
If you want solution for this precise equation, look for thue
equation.
The thue equations are some of the few for which
Brilliant, thanks. Very easy, and it works! Sorry I did not find
that myself the Manage Users facility looks excellent!
John
On Dec 8, 4:39 pm, William Stein wst...@gmail.com wrote:
On Tue, Dec 8, 2009 at 6:47 AM, John Cremona john.crem...@gmail.com wrote:
Is it possible to reset
The r is python's decorator code for a raw string: see here
http://docs.python.org/reference/lexical_analysis.html#strings
John
On Dec 24, 4:38 am, Dr. David Kirkby david.kir...@onetel.net
wrote:
William Stein wrote:
On Wed, Dec 23, 2009 at 12:42 PM, Dr. David Kirkby
then happen to those running worksheets?
John Cremona
--
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.com/group/sage-support
URL
On Jan 21, 8:49 pm, William Stein wst...@gmail.com wrote:
On Thu, Jan 21, 2010 at 12:14 PM, John Cremona john.crem...@gmail.com wrote:
Advice needed on restarting a notebook server (now that I have
successfully built 4.3.1).
I guess that the admin for sagenb.org must do this all the time
volunteer!
John Cremona
On Jan 21, 11:12 pm, jtyard jty...@gmail.com wrote:
Is there a way to change the generators used in the internal
representation of the unit group of a number field? I am currently
doing this by hand in an ad-hoc manner and it is very tedious, not to
mention prone
Just to confirm: my database is a database of elliptic curves defined
over Q and conductor up to some bound, currently 130,000.
John Cremona
On Jan 22, 2:01 am, Alex Ghitza aghi...@gmail.com wrote:
On Thu, 21 Jan 2010 16:36:47 -0800, William Stein wst...@gmail.com wrote:
Aren't those curves
On Jan 21, 10:38 pm, John Cremona john.crem...@gmail.com wrote:
Many thanks. I'll report back how I get on.
As promised: everything appears to be working perfectly. I'm not
sure that any of the users even noticed.
The following also worked: with the nb server running, I installed
polynomials would be intuitive and useful.
but this certainly does not generalize to multivariate polynomials.
The code I was using until very recently (sage 4.3.1 I guess) was like
I tried all the examples you give below in Sage-4.3.2 and they all
worked fine, and not as you report.
John Cremona
just as long both on downloading and in
building; (2) the new version does not work; and (3) you have now lost
your old working version. This is probably unduly pessimistic, but
that has been my experience! Of course you might have a better time.
John Cremona
On Feb 22, 8:09 pm, Dana Ernst dcer
+ 3
To: Algebraic Field
Defn: a |-- 0.500? + 1.532538582836189?*I
John Cremona
-- Forwarded message --
From: esisk esisk...@gmail.com
Date: 26 February 2010 00:18
Subject: Re: Splitting field
To: John Cremona john.crem...@gmail.com
Mr.Cremona,
Emailing people
, and would be easy to implement.
But of course, if this was implemented then in both your examples
expand(fac_f)==f would return True. You could always use
p.is_irreducible instead!
John Cremona
On Feb 27, 1:56 am, Nathaniel Troutman nathanieltrout...@gmail.com
wrote:
I'm new to sage
up
to 100, I think.
John Cremona
On Mar 4, 5:02 pm, Ben Linowitz benjamin.linow...@gmail.com wrote:
Marshall,
Here is an indented version of the program. I did not think that I was
creating too many variables, as I intended the program to simply
overwrite their values during each loop
around non prime subfield embeddings?
Not at present; but there has been recent work on this which is going
through the review process.
John Cremona
Thanks,
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr
Perhaps even more important is to note that that guide was written 3
years ago, and (as far as I know) has not been updated since, so it
probably gives examples based on an even earlier version of Sage than
3.0.5.
John Cremona
On Mar 14, 4:19 pm, Harald Schilly harald.schi...@gmail.com wrote
fo ease of use by Sage.
This is documented (briefly) at http://trac.sagemath.org/sage_trac/ticket/8184
showing that the fix has been in Sage since 4.3.3 (and maybe in the
mwrank source code also).
John Cremona
On Mar 16, 1:48 pm, Julian julian.agui...@ehu.es wrote:
Dear group,
I have noticed
Here's the problem. For an elliptic curve defined over a ring, not a
field, the _point_class (which is the class used to hold its points)
is the class EllipticCurvePoint, but that class has almost no methods
at all defined for it, not even an __init__ method. By contrast, for
elliptic curves
the day
before our meeting, and made some changed to it which I later
regretted and tried to revert. Without success
Any suggestions welcome!
John Cremona
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support
A3(list(P)) works here -- answering the easier of your two questions!
John Cremona
On Apr 19, 2:33 am, vdelecroix 20100.delecr...@gmail.com wrote:
Hello,
I'm trying to implement an algorithm for factorization of bivariate
polynomials. A step of the algorithm is Hensel lifting and I
It works to do this:
%gp
\r file.gp
but then you are in a separate gp session.
Are you hoping to read in stuff from your gp file and have the same
quantities / functions available from Sage?
John Cremona
On Apr 24, 1:23 am, Alex P alexvpetr...@gmail.com wrote:
Hi all,
I was trying to use
Please don't move discussions off list. Others may want to contribute
or just read the discussion.
-- Forwarded message --
From: Alex P alexvpetr...@gmail.com
Date: 24 April 2010 22:15
Subject: Re: loading a PARI script into SAGE
To: John Cremona john.crem...@gmail.com
Yes. I
Thanks for *not* complaining about the multiplicative in Torsion
Subgroup isomorphic to Multiplicative Abelian Group...
I once wrote a patch to fix that but no-one liked it enough.
I also tried E.change_ring(QQbar).torsion_subgroup() but that failed
for a different reason! For some reason,
Thanks, I was just being stupid.
John
On Apr 27, 9:19 pm, William Stein wst...@gmail.com wrote:
On Tue, Apr 27, 2010 at 12:04 PM, John Cremona john.crem...@gmail.com wrote:
Thanks for *not* complaining about the multiplicative in Torsion
Subgroup isomorphic to Multiplicative Abelian Group
There was another similar thread a few days ago, with a little more
information. It would actually not be difficult to get this working
naturally (famous last words).
There is quite an old ticket already out for this (#1975, see
http://trac.sagemath.org/sage_trac/ticket/1975).
John
On May 3,
The simplest workaround, I think, is to set
E._point_class =
sage.schemes.elliptic_curves.ell_field.EllipticCurve_finite_field
after creating E and before attempting to create points.
Example:
sage: E6 = EllipticCurve(Integers(6),[0,0,1,-1,0])
sage: E6._point_class =
):
...
ZeroDivisionError: Inverse of 1520944668 does not exist
(characteristic = 1715761513 = 26927*63719)
If other Sage developers like this it will soon become a standard
feature!
John Cremona
On May 4, 6:59 pm, John Cremona john.crem...@gmail.com wrote:
The simplest workaround, I think
101 - 200 of 665 matches
Mail list logo
