ave never guessed that list(b) works. Should there be b.list() or
> b.coefs() ?
>
>
> On 27 November 2024 02:48:05 GMT-06:00, John Cremona
> wrote:
>
>> Use list() to get the coefficients:
>>
>> sage: P=x^3-2*x^2-x-2
>> sage: F125.=GF(5^3,name='a',
Use list() to get the coefficients:
sage: P=x^3-2*x^2-x-2
sage: F125.=GF(5^3,name='a',modulus=P)
sage: b=a^37;b
4*a^2 + 3*a + 1
sage: Zy. = ZZ[]
sage: Zy(list(b))
4*y^2 + 3*y + 1
On Wednesday, 27 November 2024 at 06:51:57 UTC Dima Pasechnik wrote:
> A natural way would be to construct the quotie
False alarm -- the current version of Safe computes this correctly,
presumably because of the bugfix I made.
So this is no longer a Sage issue, but the LMFDB will need to be corrected.
John
On Wed, 1 May 2024 at 08:51, John Cremona wrote:
> This looks like the same bug as I reported
in the code but am building the current development
branch and will sort this out.
John
On Tue, 30 Apr 2024 at 17:08, John Cremona wrote:
> I can confirm that your curve is isogenous (and not isomorphic) to the
> ones in the LMFDB. The isogeny class computed by Sage from your curve has
&g
ur reply! The coefficients of my curve is [0, -27*t^2, 0,
> 216*t^3*(t - 27), -432*t^4*(t - 27)^2] with t = -4320 - 1944\sqrt{5}.
>
> -- Original --
> *From: * "John Cremona";
> *Date: * Tue, Apr 30, 2024 11:35 PM
> *To: * "John Jones&qu
https://github.com/sagemath/sage/issues/36780
On Saturday, 25 November 2023 at 15:11:53 UTC John Cremona wrote:
> Thanks for this report, which certainly indicates a bug. I will look into
> it as the code here was written by me. I note that the two curves have CM
> (by the order o
session becauses of caching of
previously computed results).
John Cremona
On Friday, 24 November 2023 at 03:50:54 UTC hbetx9 wrote:
> Hi,
>
> In some work on isogeny clases, my team ran across the following of two
> elliptic curves which are isogenous but sage reports diffe
ve its orientation flipped.
John
>
>
>
> On Mon, Jun 19, 2023 at 2:00 PM Dima Pasechnik wrote:
> >
> > oh, right, what I suggested isn't what you asked for, sorry.
> >
> >
> > On Mon, 19 Jun 2023, 13:56 John Cremona, wrote:
> >>
> >&
12:08:18 PM UTC+1 Dima Pasechnik wrote:
> On Mon, Jun 19, 2023 at 11:18 AM John Cremona wrote:
> >
> > I have some quite small graphs which are polyhedral, each is the
> 1-skeleton of a (connected convex) polyhedron such as a cube, tetrahedron,
> etc, constructed from a lis
I have some quite small graphs which are polyhedral, each is the 1-skeleton
of a (connected convex) polyhedron such as a cube, tetrahedron, etc,
constructed from a list of edge pairs.
I can get the faces of one of these, say G, via G.faces(). This returns a
list of lists of vertices, each one bei
I'm sure I have seen posts about this but cannot find them or guess the
appropriate commands.
In testing variants of some new and algorithms to compute the same thing I
know how to measure the CPU time taken using cputime(), but is there a way
I can tell how much memory was used -- the maximum bet
Thanks!
On Tuesday, September 27, 2022 at 3:02:25 PM UTC+1 Kwankyu wrote:
> This bug is tracked now in
>
> https://trac.sagemath.org/ticket/34591
>
> On Tuesday, September 27, 2022 at 6:31:39 PM UTC+9 wdjo...@gmail.com
> wrote:
>
>> On Tue, Sep 27, 2022 at
Am I doing something stupid here, or is this a bug?
sage: R = Integers(8)
sage: RXY. = R[]
sage: F = X^3-X^2*Y+X*Y^2+Y^3
sage: F([4,2])
6
sage: 4^3-4^2*2+4*2^2+2^3
56
sage: (4^3-4^2*2+4*2^2+2^3) % 8
0
Why does F not evaluate to 0 mod 8 at X=4, Y=2? Rather obviously, each
of the terms in F(4,2) i
As expected, using firefox to navigate to the file in .sage works fine.
But also, I found that within a notebook the 3d display is just fine on
chromium too -- complete with rotation and zooming in and out. That is
very nice.
On Tuesday, November 9, 2021 at 7:36:43 PM UTC John H Palmieri wrot
Thanks for all the replies. I did not respond earlier just because I have
my Google groups set to daily summary for this group which meant that none
of the replies even landed in my inbox until today's summary. That's not
very helpful of Google.
OK, so for the time being I ll use Firefox to see
I don't often use 3D graphics, but when I run implicitplot3d() I get
a file permissions error (on ubuntu 20.04):
# example from the docstring
sage: var('x,y,z')
(x, y, z)
sage: implicit_plot3d(x^2+y^2+z^2==4, (x,-3,3), (y,-3,3), (z,-3,3))
Launched html viewer for Graphics3d Object
Over in my br
More generally uf all the coefficients can be coerced into AA then the
roots in QQbar not in AA come in pairs.
On Wed, 22 Sep 2021, 09:23 Dima Pasechnik, wrote:
>
>
> On Wed, Sep 22, 2021 at 9:19 AM Dima Pasechnik wrote:
>
>>
>>
>> On Wed, Sep 22, 2021 at 8:10 AM Tracy Hall wrote:
>>
>>> I ran
At the end of a run of some code I have run before, without seeing this:
/usr/local/sage/sage-9.3/local/lib/python3.9/site-packages/prompt_toolkit/renderer.py:514:
DeprecationWarning: The explicit passing of coroutine objec
ts to asyncio.wait() is deprecated since Python 3.8, and scheduled for
rem
I havethe problem reported here -- but apparently solved in ipython
7.1.1, but I am using sage-9.2 with ipython 7.13.0 (as reported by
"sage -ipython").
https://stackoverflow.com/questions/52947493/ipython-how-to-continue-code-on-the-next-line
I start entering a loop like this
sage: for n in [1..
st of these are congruent to 1 mod 4 so the j-value is
j((1+sqrt(d))/2) , only those which are 0 mod 4 are on the imaginary axis
with values j(sqrt(D)/2) as in your list.
THere is a big theory of complex multiplcation behind these facts, but I
don'y think that "gp in Sage" is an acc
Suppose I enter a command at the Sage prompt and it runs and runs,
producing vast amounts of output to the screen (too much to scroll
back), during which I start to wonder if I typed the command correctly
or perhaps added a 0 to a parameter by mistake. I don't want to
interrupt the computation. I
I never deliberately use the Symbolic Ring since I believe in algebra.
But I wanted to simplify some quite complicated expressions involving
infinite series in one variable called 'p', nothing more complicated
that geometric series, and from sum? I learned that this could be done
in SR. However th
I suspect the question might have been referring to elliptic curves over finite
fields. In the ordinary case you can ask for the Frobenius order and know that
the endomorphism ring is between that and the maximal order of its field of
fractions (an imaginary quadratic field) but as far as I know
On Saturday, January 11, 2020 at 10:49:08 AM UTC, Benjamin Matschke wrote:
>
> Computing the global minimal model of an elliptic curve over a number
> field isomorphic to QQ...
>
> sage: K. = NumberField(x-1)
> sage: E = EllipticCurve(K,[0,2])
> sage: E.global_minimal_model()
>
> ... raises an u
On Fri, 8 Nov 2019 at 01:33, saad khalid wrote:
> This functionality seems to be intended somehow? At least, it is made
> reference to in the documentation:
> http://doc.sagemath.org/html/en/reference/matrices/sage/matrix/matrix2.html
> Look at the part after:
> "A matrix that is not diagonalizab
On Tue, 30 Jul 2019 at 05:56, Kwankyu wrote:
>
>
> On Thursday, July 25, 2019 at 12:08:20 AM UTC+9, chandra chowdhury wrote:
>>
>> I have matrices B and C of size (m,n) over integer with m>n.
>> I know there is matrix A of size (m,m) such that
>> AB=C. How to find A efficiently in Sage?
>>
>
Try
As far as I know the answer is "no" except for elliptic and hyperelliptic
curves.
John Cremona
On Tue, 9 Jul 2019 at 00:47, Caleb Robelle wrote:
> I am using sage version 7.3 on Linux mint 18. I was wondering if there are
> algorithms to count points of multivariate polynom
On Mon, 17 Jun 2019 at 13:02, chandra chowdhury
wrote:
> Hi,
> I have multi variable polynomial over integers say f(x,y,z).
> I want to define it over GF(5) efficiently.
>
> For that I am doing this:
>
>
> R=PolynomialRing(GF(5), 3, 'X')
> Z = list(R.gens())
>
> But g=R(f(Z)) is not working.
>
On Wed, 22 May 2019 at 11:18, John Cremona wrote:
>
>
> On Wed, 22 May 2019 at 11:17, John Cremona wrote:
>
>>
>>
>> On Wed, 22 May 2019 at 10:27, slelievre
>> wrote:
>>
>>> Le mercredi 22 mai 2019 10:00:34 UTC+2, John Cremona a écrit :
&
On Wed, 22 May 2019 at 11:17, John Cremona wrote:
>
>
> On Wed, 22 May 2019 at 10:27, slelievre wrote:
>
>> Le mercredi 22 mai 2019 10:00:34 UTC+2, John Cremona a écrit :
>>>
>>> Paul Zimmermann suggested using -nodotsage, which apparently creates a
>>
On Wed, 22 May 2019 at 10:27, slelievre wrote:
> Le mercredi 22 mai 2019 10:00:34 UTC+2, John Cremona a écrit :
>>
>> Paul Zimmermann suggested using -nodotsage, which apparently creates a
>> temporary .sage directory which I expect would be different for different
>&g
Paul Zimmermann suggested using -nodotsage, which apparently creates a
temporary .sage directory which I expect would be different for different
runs. This is not ideal since currently the scripts I am running this way
make use of a %runfile command in ~/.sage/initsage to load all the
functions ne
(from the command
line) appears not to. Am I missing something?
John Cremona
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-suppor
On Wed, 3 Apr 2019 at 18:56, John H Palmieri wrote:
>
>
> On Wednesday, April 3, 2019 at 10:11:19 AM UTC-7, kcrisman wrote:
>>
>>
>>
>> On Tuesday, April 2, 2019 at 6:03:23 PM UTC-4, Dima Pasechnik wrote:
>>>
>>> On Tue, Apr 2, 2019 at 10:47 PM wrote:
>>> >
>>> > Hello, Sage community.
>>> > Wit
You did not say what command you were using. The documentation for both
primes() and prime_range() show examples with much larger primes.
John Cremona
On Tue, 12 Mar 2019 at 11:25, Peter Luschny wrote:
> ValueError: Cannot compute primes beyond 436273290
>
>
> I think SageMa
Perhaps an easier way to debug this is to use the fact that the global
maple object is defined in the Sage library by the assignment maple=Maple()
(in sage/interfaces/maple.py) and if at the top of your Sage session you do
maple = Maple(logfile="maple.log")
then you can take a look in that file to
On Tue, 26 Feb 2019 at 17:01, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> I don't think this has ever been implemented in Sage. You
> have to figure out how to create a sparse matrix in magma
> and write Sage code to produce it. You can get inspiration
> from the current code of _magma_
On Wed, 20 Feb 2019 at 14:24, Douglas Webster
wrote:
> Thank you, Isuru, for the assistance, but I'm afraid it still isn't
> working. The program is still crashing, but this time it seems to be the
> elliptical curves module that is causing the problem. A copy of the crash
> report is attached
1. You can use srange which works like range but gives a list of Sage
integers.
2. To coerce an int to a Sage Integer just use ZZ():
sage: srange(1,4)
[1, 2, 3]
sage: [type(i) for i in srange(1,4)]
[,
,
]
sage: range(1,4)
[1, 2, 3]
sage: [type(i) for i in range(1,4)]
[, , ]
sage: [type(ZZ(i)) fo
On Mon, 4 Feb 2019 at 10:01, Jan Groenewald wrote:
> Hi
>
> On Mon, 4 Feb 2019 at 11:58, J E Cremona
> wrote:
>
>> Is it possible to specify which port the jupyter notebook server runs
>> on? I think the default is , but sometimes a different one is used
>> (e.g.8889 if is in use). I
On Wed, 12 Dec 2018 at 20:44, Nils Bruin wrote:
> I would expect magic commands to work a little differently in the jupyter
> gui than on the command line, so the possibility for an error doesn't
> surprise me too much. It can probably be fixed. However, a straight-up
> "attach('')" would hopeful
I have a file testcong.py which contains various functions I am developing,
while testing them in a jupyter notebook. The first cell in the notebook
has the "magic" line "%run testcong.py" and so whenever I make a change to
the .py file I have to re-click on that cell. This gets tedious,
especial
On Mon, 19 Nov 2018 at 13:45, Dima Pasechnik wrote:
>
>
> On Monday, November 19, 2018 at 1:14:38 PM UTC, Kolen Cheung wrote:
>>
>> "shut up" is language issue? You dont know whats bad language.
>
>
> I bet I can swear in more languages than you do: English, Russian, Dutch,
> German, Ukrainian, P
ython, and has the wrong precedence.
# Now we can work with this:
>>> f = x**3+1 # that's better
>>> f.factor()
(x + 1) * (x^2 - x + 1)
Another thing I do is to put my commands into a .py file and run pyflakes
on it, as that reveals what things need to be imported. Then
le to
work out what makes the difference.
John
On Thu, 25 Oct 2018 at 19:15, Nils Bruin wrote:
> On Thursday, October 25, 2018 at 9:12:56 AM UTC-7, Nils Bruin wrote:
>>
>> On Thursday, October 25, 2018 at 7:13:26 AM UTC-7, John Cremona wrote:
>>>
>>> sage: for
stops working because of the 'break' -- does it?
John Cremona
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups
On Tue, 2 Oct 2018 at 08:56, wrote:
> If I have a matrix [1,0,1] [0,1,1] [0,0,0], [0,0,0], how do I delete the
> zero rows? (in this case rows 2 and 3). I know how to manually delete them,
> but what about for all cases, regardless of input. I want to have all the 0
> rows deleted in any matrix.
On 9 August 2018 at 12:20, Volker Braun wrote:
> So whats in /home/jec/.sage/jupyter-4.1/jupyter_notebook_config.json
>
Ah! It contains
{
"NotebookApp": {
"password": "sha1:af540ed8f4"
}
}
(where I have deleted most of the password). I moved that file away and
now all is wel
al/sage/sage-2/local/lib/python2.7/site-packages/notebook/static/auth/js/main.min.js
[D 12:15:00.764 NotebookApp] 304 GET /static/auth/js/main.min.js (::1)
2.14ms
and still no token is appearing.
Luckily I have other computers all working fine with 8.3, on which I have
moved my current
ve on ?
>
That's where another user is running sage/jupyter,
>
>
> On Thursday, August 9, 2018 at 11:25:44 AM UTC+3, John Cremona wrote:
>>
>>
>>
>> On 9 August 2018 at 08:26, Volker Braun wrote:
>>
>>> The token does get generated
which at least shows that some of the error messages I get when trying to
run Sage jupyter notebook are nothing to do with Sage.
>
>
> On Wednesday, August 8, 2018 at 5:38:03 PM UTC+2, John Cremona wrote:
>>
>> I just updagred to 8.3 on a machine (ubuntu 16.04) where I ha
I just updagred to 8.3 on a machine (ubuntu 16.04) where I have frequently
run Sage both command-line and jupyter notebook previously. Now when I type
sage --notebook=jupyter
I see
┌┐
│ SageMath version 8.3, Release Date: 2018-
On 7 August 2018 at 20:56, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> The global binomial function is to be blamed. The one
> in arith works fine
>
> sage: R. = ZZ[]
> sage: sage.arith.all.binomial(q,2)
> 1/2*q^2 - 1/2*q
> sage: sage.arith.all.binomial(q,2).parent()
> Univariate Polyno
On 10 July 2018 at 11:02, Dima Pasechnik wrote:
>
>
> On Tuesday, July 10, 2018 at 10:58:45 AM UTC+1, John Cremona wrote:
>>
>>
>>
>> On 10 July 2018 at 10:48, Dima Pasechnik wrote:
>>
>>> I imagine it makes little sense to ask for open-sourci
ticket/22982 (a meta-ticket where kash is a
>> part of)
>>
>> I think it's unfortunately a wasted effort (as far as kash goes)...
>>
>>
>> On Tuesday, July 10, 2018 at 9:02:24 AM UTC+1, John Cremona wrote:
>>>
>>> Thanks for the replies
Thanks for the replies. There should be a ticket opened for removing the
current instructions to use kash, whether or not they are replaced by
something else.
John
On 9 July 2018 at 23:48, Alexander Konovalov
wrote:
> Note that the Alnuth package for GAP switched from KANT to PARI/GP,
> with t
If you try (in Sage-8.2)
sage: x = polygen(QQ)
sage: f = x^12-2
sage: f.galois_group()
you will see the message
NotImplementedError: the package 'kash' was not found. You can install it
by running 'sage -i kash' in a shell
Sorry, computation of Galois groups of fields of degree bigger than 11 is
On 13 June 2018 at 10:30, Jeroen Demeyer wrote:
> Thanks for checking. In the mean time, I guess the problem might be
> related to the fact that I'm using a non-default value for primelimit in GP
> (100 instead of 50).
>
> But if you say that the problem is fixed by the PARI upgrade, I co
compiled: Jun 13
2018, gcc version 5.4.0 20160609 (Ubuntu 5.4.0-6ubuntu1~16.04.5)
threading engine: single
it seems to work fine. I see that you have opened a ticket. Thanks,
John
On 13 June 2018 at 09:40, John Cremona wrote:
>
>
> On 13 June 2018 at 09:34, Jeroe
On 13 June 2018 at 09:34, Jeroen Demeyer wrote:
> On 2018-06-13 10:25, John Cremona wrote:
>
>> THanks for looking into this Jeroen (I hoped you would). The file
>> bug.gp <http://bug.gp> you attached causes an error in the latest gp
>> (version 2.10.0), after in
THanks for looking into this Jeroen (I hoped you would). The file bug.gp
you attached causes an error in the latest gp (version 2.10.0), after
increasing parisizemax I get the same error message. But I compiled that
more than a week ago so probably before we send a bug report upstream we
should t
Sorry, I forgot to attach the polynomials. (Exercise for the reader:
recompute them with a few lines of Sage using the hint in my original post).
On 12 June 2018 at 17:26, John Cremona wrote:
> The error in the subject line comes from running the attached code which
> defines two
The error in the subject line comes from running the attached code which
defines two monic integral polynomials in QQ[x], both irreducible and
defining the same number field of degree 44, and trying to find a root of
the second in the number field defined by the first:
Trying K.is_isomorphic(L) wo
On 23 May 2018 at 15:11, Emmanuel Charpentier wrote:
> Dear Francesco,
>
> Le dimanche 20 mai 2018 18:57:54 UTC+2, Francesco a écrit :
>>
>> I tried to use emacs with sage-shell-mode, but I have some difficulty to
>> configure all things.
>>
>
> What is (are) the problem(s) ?
>
>
>> Furthermore I
On Sun, 20 May 2018, 17:57 Francesco, wrote:
> I tried to use emacs with sage-shell-mode, but I have some difficulty to
> configure all things. Furthermore I am a new user of emacs..
> Is there a clear guide of the operations to configure sage-shell-mode of
> emacs?
>
That would be helpful. But
I was using the jupyter notebook's magic %%writefile, where you put
"%%writefile [-a] filename.py" at the top of a cell and then evaluating the
cell writes the cell's contents to the file (overwriting by default, or
appending if you give the -a flag).
I found that the file so written to has the co
On 16 April 2018 at 12:04, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> On 16/04/2018 09:21, fanxue...@iie.ac.cn wrote:
>
>> I have constructed a big prime field:
>>
>>> p=68235916425158872634653027
F=GF(p)
>>>
> Here is what I get
>
> sage: p = 68235916425158872634653027
> sa
This looks like a bug to me:
sage: F=GF(3)
sage: R.=F[]
sage: C=Curve(X^8+Y^8-Z^8)
sage: C.count_points(1) # correct count over GF(3^1)
[4]
sage: C.count_points(8) # should give counts over GF(3^n) for n=1..8 but it
crashes
TypeError: F (=[X^8 + Y^8 - Z^8]) must be a list or tuple of polynomials
Harald, you might be interested in this example:
https://arxiv.org/src/1306.6818v3/anc/X13.pdf
John Cremona
On 19 March 2018 at 10:59, Emmanuel Charpentier <
emanuel.charpent...@gmail.com> wrote:
>
>
> Le dimanche 18 mars 2018 19:28:02 UTC+1, Harald Helfgott a écrit :
>>
Apologies I meant to post that on lmfdb-support. It has nothing to do with
Sage.
John
On 13 March 2018 at 22:04, Dima Pasechnik wrote:
>
>
> On Tuesday, March 13, 2018 at 4:41:02 PM UTC, John Cremona wrote:
>>
>> From the bug-report spreadsheet:
>>
>> I a
>From the bug-report spreadsheet:
I am a PhD student in Mathematics at Oxford interested in identifying
modular forms given their q expansions. To do this it would be useful to
have a copy of the `webnewforms` collection listed here
https://github.com/LMFDB/lmfdb-inventory/blob/master/db-modularfo
On 28 February 2018 at 13:49, Ralf Stephan wrote:
> Why should I define x when Sage gives me a polynomial with x, doesn't it
> already know it?
>
> That's what a user would ask and, frankly, s/he would be right.
>
Here is one reason. In this example:
sage: M=Matrix([[1,2,3],[4,5,6],[7,8,9]])
s
I think Marco (who works with me) took my suggestion to simplify his
problem code as much as possible before posting a little too literally.
Marco, send in something closer to what you showed me yesterday (which was
about factorization of polynomials of degree 4 in F[X,Y,Z] with F a quite
small fin
good to figure this out in a good way, under the ODK
> umbrella.
>
> Cheers,
> Dima
>
>
> On Tuesday, October 31, 2017 at 9:39:12 AM UTC, John Cremona wrote:
>>
>> With the old Sage notebook one could start a server running and allow
>> multiple users to create
With the old Sage notebook one could start a server running and allow
multiple users to create accounts and log into it (say behind a
firewall for security). Is that possible with the Jupyter notebook?
I have tried but unsuccessfully except as follows: when jupyter starts
up (i.e. I type 'sage -n=
ium-browser does the trick. This is a
university-supplied & configured machine which recently had a system
upgrade. They used not to provide chrome but now they do. They also
provide Sage-8.0 as standard!
John
>
> John
>
>
> On Friday, October 20, 2017 at 7:38:58 AM UTC-7, J
On 20 October 2017 at 15:34, John Cremona wrote:
> I am running Sage on a linux machine which has chromium-browser as the
> default browser, but when I type
>
> sage --notebook=jupyter
>
> it starts firefox and opens in a tab there. How can I get it to use chrome?
sage
I am running Sage on a linux machine which has chromium-browser as the
default browser, but when I type
sage --notebook=jupyter
it starts firefox and opens in a tab there. How can I get it to use chrome?
John
--
You received this message because you are subscribed to the Google Groups
"sage-
On 18 October 2017 at 10:00, Dima Pasechnik wrote:
>
>
> On Wednesday, October 18, 2017 at 9:28:50 AM UTC+1, Robin van der veer
> wrote:
>>
>> Hello,
>>
>> If I have, say,
>>
>> R = PolynomialRing(QQ, 'x', 5)
>>
>> And I have two polynomials, one of which divides the other. Then I can do
>> f/g
>
-- Forwarded message --
From: paul zimmermann
Date: 8 September 2017 at 09:27
Subject: typos wanted
To: john.crem...@gmail.com
John,
please could you post the following to sage-support (and maybe sage-devel)?
Thank you,
Paul
--
On 4 September 2017 at 07:53, Pstrang Rzekle wrote:
> Installation Guide for 8.0, Section "3.7 Installation in a Multiuser
> Environment"
> and also here:
> http://doc.sagemath.org/html/en/installation/source.html#installation-in-a-multiuser-environment
>
> erroneously inform the reader how to ins
Apologies, that was supposed to go to lmfdb-support. Ignore!
John
On 16 August 2017 at 08:48, John Cremona wrote:
> This is a very minor comment about the description/definition of "GL_2
> type" in the genus 2 curve page (after clicking the "GL_2 type" link).
&g
This is a very minor comment about the description/definition of "GL_2
type" in the genus 2 curve page (after clicking the "GL_2 type" link).
The last sentence is a bit misleading. Perhaps it should say "the
endomorphism algebra is 2-dimensional over Q" as opposed to "the
endomorphism algebra is is
int, perhaps, is that polynomials over Z/25Z do not form
a unique factorization domain (or even a domain) so even the
definition of what factors you might want to see is unclear.
Following Nils, for a prime power modulus, a sensible definition is to
take an approximation of the p-adic factorization. The
On 10 July 2017 at 14:56, Nils Bruin wrote:
> On Monday, July 10, 2017 at 3:38:27 PM UTC+2, John Cremona wrote:
>>
>> Sage does have a function is_norm() for number field elements so the
>> underlying algebraic problem should be solvable.
>
>
> It looks like the
Sage does have a function is_norm() for number field elements so the
underlying algebraic problem should be solvable.
Example (p=3):
sage: Q3. = CyclotomicField(3)
sage: a=2+3*z
sage: b=3+4*z
sage: x=polygen(Q3)
sage: L.=Q3.extension(x^3-a)
sage: b.is_norm(L)
False
On 10 July 2017 at 14:23, Pier
My guess is that the output is buffered, i.e. it does not get actually
written out unti lthe buffer reaches some size. You can get python to
flush the output after every output statement and then see what is
happening a bit better.
John
On 7 June 2017 at 16:33, Robin van der veer wrote:
> Hi,
>
On 5 June 2017 at 20:04, John Cremona wrote:
> Thanks for the suggestions. I was implementing something like Dima's
> suggestion and noticed that the function has 3 different return
> statements, one of which is not normal (some runtime error in Magma)
> but two are normal and
ed, and
>> it's hard to say exactly what to do
>> with is. A documentation bug?
>>
>>
>>
>>
>> On Monday, June 5, 2017 at 2:44:32 PM UTC+1, John Cremona wrote:
>>>
>>> On a linux (ubuntu 16.04) machine I am running one instance of Sage
&g
On a linux (ubuntu 16.04) machine I am running one instance of Sage
version 7.6. In a loop I am calling a function of my own which
interfaces to Magma; that function starts with
mag = Magma()
then there are a whole lot of mag.eval() statements and af ew others
with which I collect the content o
dicate that
they are internal and not normally intended for use by users).
John Cremona
On 24 May 2017 at 00:29, Lee Morgenstern wrote:
> How do I disable caching for elliptic curve gens() results?
>
> The cache doesn't store (or check) enough information
> to return the co
n answer is about the latter.
Not really: generators of the additive group are coprime to p, not to p-1.
Perhaps Johan was thinking of the fact that if g is one multiplicative
generator (aka primitive root) then g^k is another if and only if
gcd(k,p-1)=1.
John Cremona
>
> For very large p such
o 2009:
> see sage/misc/latex_macros.py.
I am also surprised since I have used SageTeX before without this
problem! In fact I was running it on a tex file which used to work.
On a different computer though...
John
>
> --
> John
>
>
> On Monday, May 8, 2017 at 12:25:12 PM U
In Sage 7.6:
sage: latex(QQ)
\Bold{Q}
but \Bold is not a standard LaTeX macro. However,
sage: show(QQ)
\newcommand{\Bold}[1]{\mathbf{#1}}\Bold{Q}
shows that the macro is defined somewhere in Sage itself.
Next, if I create a file mini.tex containing
\documentclass{article}
\usepackage{sagetex}
On 9 April 2017 at 15:20, Simon King wrote:
> Hi Bill,
>
> On 2017-04-08, 'Bill Cox' via sage-support
> wrote:
>> I want to test finding the discrete log in the circle group over Z/Zm --
>> discrete logs of g^a mod m, where g is a complex number and m is composite.
>> Can Sage do this for large
It works fine if you insert * between the parentheses -- no implicit
multiplication:
sage: gamma3(a,b,c,j) =
1/((e^(2*pi*i*(a*j/16))-1)*(e^(2*pi*i*(b*j/16))-1)*(e^(2*pi*i*(c*j/16))-1))
sage: sum(gamma3(1,2,9,j) for j in [1..7]).n()
3.00 - 0.249*I
On 31 March 2017 at 19:17
You should not need to import anything. For example
sage: F = GF(2^3)
sage: type(F)
sage: F = GF(2^4)
sage: type(F)
sage: F = GF(2^16)
sage: type(F)
Note that the type will depend on the cardinality since Sage uses
different backend implementations. Unless you have very some very
unusual req
Your question is puzzling since i is a constant, and 1/(s-i) =
(s+i)/(s^2+1) so the expressions are equal.
John Cremona
On 6 Mar 2017 17:35, "Hemanth G" wrote:
> Dear All,
>
> How do you make SageMath to consider the term "i" as a complex term.Here
> the
On 21 February 2017 at 22:02, Watson Ladd wrote:
>
>
> On Tuesday, February 21, 2017 at 1:07:43 PM UTC-8, Jeroen Demeyer wrote:
>>
>> On 2017-02-21 22:02, Watson Ladd wrote:
>> > I am having trouble figuring out which imports I need to get the
>> > right names to appear
>>
>> Use the import_statem
On 21 February 2017 at 08:38, 'Martin R. Albrecht' via sage-support
wrote:
> Hi,
>
> I don’t think this is implemented in Sage.
I think it is: searching for weak_popov_form finds results in
matrix/matrix2.pyx with a method M.weak_popov_form(), though
admittedly the docstring for that says
".. WA
1 - 100 of 736 matches
Mail list logo
