[sage-support] Re: How to move Sage to a different computer?

Hi Dima, just for the record: Both the master and the develop version are now built and they work. Thank you! Best regards, Simon On 2021-11-14, Dima Pasechnik wrote: > Hi Simon, > > On Sun, Nov 14, 2021 at 1:26 AM Simon King wrote: >> >> Hi Dima, >> >> On

[sage-support] Re: How to move Sage to a different computer?

Dear Dima, On 2021-11-14, Dima Pasechnik wrote: > You need to clean old stuff, I suppose > > git clean -fdx > > should do it. Thank you! It seems that it did the trick. In the development version, "make" now says to do "./configure" first (which in the past was done automatically, but I guess

[sage-support] Re: How to move Sage to a different computer?

PS: On 2021-11-14, Simon King wrote: > On 2021-11-14, Dima Pasechnik wrote: >> hmm, if you really checked out the latest version and have done >> `make distclean`, then it should have worked (it does work, you know). In other words: With the latest develop version, even "ma

[sage-support] Re: How to move Sage to a different computer?

Hi Dima, On 2021-11-14, Dima Pasechnik wrote: > hmm, if you really checked out the latest version and have done > `make distclean`, then it should have worked (it does work, you know). > > Do you mean to say that you merged in (or rebased over) the latest > develop branch, and getting errors

[sage-support] Re: How to move Sage to a different computer?

PS: When I go to the master branch instead of develop branch, I do not have the problem with the spkg type "pip" --- but "make" soon fails, because when the "patch" spkg is built, configure claims that the C compiler cannot create executables - which is wrong: I tested, and I can create an

[sage-support] How to move Sage to a different computer?

Hi! I have some Sage installation on one laptop, including many branches. Now I want to move on a different laptop, keeping these branches. I tried to do something like "cp -r", then checking out the latest development version. I think it worked so far. But, when trying "make distclean" or

[sage-support] Re: differentiation in InfinitePolynomialRing

Hi Nils, can you open a ticket for it? Best regards, Simon On 2021-09-08, Nils Bruin wrote: > On Wednesday, 8 September 2021 at 09:24:15 UTC-7 max...@gmail.com wrote: > >> Hi Simon, >> >> Thank you for your insight, and let me state that I >> find InfinitePolynomialRing useful in

[sage-support] Re: differentiation in InfinitePolynomialRing

Hi Max, On 2021-09-08, Max Alekseyev wrote: > I've found a couple of issues with differentiation in InfinitePolynomialRing > > (ISSUE #1) Differentiation fails in InfinitePolynomialRing(QQ), e.g. the > following code > > R. = InfinitePolynomialRing(QQ) > f = x[0] + x[1] > derivative(f,x[1]) > >

[sage-support] Re: What's the easiest way to calculate a Hironaka standard basis using SageMath?

Hi Joshua, SageMath uses Singular to compute Gröbner and standard bases. I think that Singular (and thus, SageMath) doesn't strictly distinguish between a Gröbner basis and a standard basis, because in a global term ordering (i.e. 1 is smallest), both notions coincide, and thus in local term

[sage-support] Re: factorial

OK in written math but, just as implicit multiplication, as bad in CAS use. > So I'm not in favour of it. I estimate that the number of arguments against > it is at least 3! > > On Sunday, November 29, 2020 at 5:32:30 AM UTC-8 Simon King wrote: > >> On 2020-11-29, Simon King

[sage-support] Re: factorial

On 2020-11-29, Simon King wrote: > Hi Emmanuel, > > On 2020-10-28, Emmanuel Charpentier wrote: >> Nope. This syntactic sugar is provided by `Maxima`'s and `Mathematica`'s >> readers, but not by Sage preparser. > > Would it be nice (and easy) to have in Sage? What pr

[sage-support] Re: Groebner bases for supercommutative polynomial algebras.

Hi Reimundo, On 2020-11-29, 'Reimundo Heluani' via sage-support wrote: > Well, in the Noetherian case this works fine. The setup I need is a > non-noetherian algebra: a polynomial differential algebra, that is > polynomials > in x_1,...,x_n and all of their formal derivatives. So this is a

[sage-support] Re: factorial

Hi Emmanuel, On 2020-10-28, Emmanuel Charpentier wrote: > Nope. This syntactic sugar is provided by `Maxima`'s and `Mathematica`'s > readers, but not by Sage preparser. Would it be nice (and easy) to have in Sage? What prevents the preparser from understanding "!"? Best regards, Simon --

[sage-support] Re: Groebner bases for supercommutative polynomial algebras.

Hi Reimundo, On 2020-06-17, 'Reimundo Heluani' via sage-support wrote: > Is there an implementation of such a thing as in the title? TL;DR: Yes. Singular does have these capabilities. I recall that these were comfortably wrapped in SageMath, but as it turns out: They aren't. Note to

[sage-support] Different ways of rounding

Hi! According to IEEE 754, the default rounding mode for floating-point operations is "round half to even". However, if one calls "round" on elements of RR, the rounding apparently is "round half away from zero if the total number of digits in the result is odd and towards zero if the total

[sage-support] Re: naive question

On 2020-03-07, Eric Gourgoulhon wrote: > You should use simplify_full() instead of simplify(): Or you should rather use *polynomials* instead of general symbolic variables, provided of course that all your expressions are multivariate rational functions (which is the case here): > sage: var('s

[sage-support] Re: Approximating integral with infinite bounds

Hi Emmanuel, On 2020-02-29, Emmanuel Charpentier wrote: > This question would have been more properly posed on ask.sagemath.org... Why? I for one totally dislike ask.sagemath.org and would never post a question or an answer there. It is of course a matter of taste. But it is certainly not

[sage-support] Re: Output in characteristic 2

Hi Samanta, On 2020-02-03, Samanta wrote: > I have defined the input variables in characteristic 2. No, you haven't, see below. > But when I assign a > particular value to the input, output gives the result in simple algebra > not in characteristic 2. Here is my code: > sage: P. = GF(2)[]

[sage-support] Re: help cartesian_product?

Hi Roland, On 2019-12-07, Rolandb wrote: > I did not expect parts of the help text; see Class docstring: > > Is there a reason for it? What exactly is your question? Are you asking for the reason why you did not expect parts of the help text? Only you can answer that question. Are you asking

[sage-support] Re: sage building with python3

Hi Dima, On 2019-11-02, Dima Pasechnik wrote: > There "python" is Sage's Python, "pip" manages its modules, etc. IIRC, that's not true for Sage's py-3 version. Namely, if one opens a sage-with-py-3 shell, then "python" still means "python2". So, if you really want Sage-with-py-3's Python

[sage-support] Re: Tracking memory usage and time

On 2019-09-03, Jori Mäntysalo wrote: > On Mon, 2 Sep 2019, J wrote: > >> Thanks get_memory_usage sounds good; I want to run several decoders from >> the coding theory module to see better show there ups and downs; > > There is also at least %mprun magic. Googling that will give you some >

[sage-support] Re: Cannot load session create in another version of sage

Hi Vincent, On 2019-09-03, Vincent Delecroix <20100.delecr...@gmail.com> wrote: >> In fact it isn't compatible, but that of course means it must be >> attempted to make it compatible. > > It is already compatible. You just need to specify which kind of > data has been pickled ('bytes' vs 'str')

[sage-support] Re: Cannot load session create in another version of sage

Hi Vincent, On 2019-09-03, Vincent Delecroix <20100.delecr...@gmail.com> wrote: >> I believe a CAS which doesn't even *attempt* to offer a way to store user >> data permanently and reliably is a failure. I'll rant more on it on the >> ticket. > > I strongly agree that this is a needed feature!

[sage-support] Re: Cannot load session create in another version of sage

Hi Vincent, On 2019-09-03, Vincent Delecroix <20100.delecr...@gmail.com> wrote: >> If I understand correctly, saving/loading individual objects is supposed to >> be backwards compatible. > > This is not correct. Saving individual object is not supposed to > be backward compatible. See > >

[sage-support] Re: Tracking memory usage and time

Hi J, On 2019-08-24, J wrote: > to do a overview of a rather different set of `SAGE` methods, I would > like to not only track the time used to run a command, but also the > memory usage of the commands. > > Is there a recommended way to do this? I am a bit surprised that nobody answered this

[sage-support] Re: SageMath for non-Debian/Ubuntu Linux?

Hi! On 2019-09-02, Szabolcs Horvát wrote: > Are there pre-built binaries for other Linux varieties than Debian/Ubuntu, > or perhaps a "generic" variety that works on all common Linuxes? > > I am looking to install Sage into my home directory on an openSUSE system > where I do not have root

Re: [sage-support] Cannot load session create in another version of sage

Hi Steve, On Friday, August 30, 2019 at 11:55:45 AM UTC+2, Dima Pasechnik wrote: > > On Fri, Aug 30, 2019 at 12:48 PM 'SteveJJ' via sage-support > > wrote: > > > > I saved a session when using sage 8.0. > > > > When I try to load that session into sage 8.8, I get errors such as: > > > >

[sage-support] Re: Help/Pointers on using docker with travis-ci

iner. Would you recommend a different solution? Best regards, Simon On 2019-07-30, Simon King wrote: > Nathan, > > On 2019-07-29, Nathan Dunfield wrote: >> You can start a container and open a shell on it via: >> >> docker run -it image_name /bin/bash >> >

[sage-support] Re: Help/Pointers on using docker with travis-ci

Nathan, On 2019-07-29, Nathan Dunfield wrote: > You can start a container and open a shell on it via: > > docker run -it image_name /bin/bash > > The container will keep running until you exit the shell, if not longer. > You can open a shell on any running container via > > docker exec -it

[sage-support] Help/Pointers on using docker with travis-ci

Hi! Last week at Sage Days 100 I learned how to put the code for my group cohomology spkg on github and got an introduction on using travis-ci. However, it seems that I need more help/pointers, in particular on docker. The things that I want travis-ci to do are: - Install dependencies of my code

[sage-support] Re: How to export notebook worksheet to text file

Hi, The post you are replying to is about 9 years old. Meanwhile, it is (I think) recommended to not use the legacy Sage notebook (sagenb), but use jupyter. So, do you really have the problem of converting a Sage notebook, or a jupyter worksheet? Best regards, Simon On 2019-07-23, 'Perez

[sage-support] Re: problem with matrix over finite field

Hi Harald, On 2019-07-12, Harald Schilly wrote: >> Do you literally mean "user", not the specific name of a single user? > > yes, all cocalc projects run under the same user "user" in their own > container. > No, /home/user is a read/write mounted volume and ~/.sage is a > directory inside of

[sage-support] Re: problem with matrix over finite field

Hi Harald, On 2019-07-12, Harald Schilly wrote: > Interestingly, this works: > > matrix(GF(16), [[1,0], [0, 1]]) while matrix(GF(25), [[1,0], [0, 1]]) fails > with the above error. MeatAxe is only used for finite non-prime fields of order <255, and I forgot to add: Only in odd characteristic

[sage-support] Re: problem with matrix over finite field

Hi Harald, On 2019-07-12, Harald Schilly wrote: > Ok... To me, this sounds like we have to uninstall MeatAxe on CoCalc. > > The CoCalc setup is quite easy to explain, and so far I wasn't aware of any > issues. Sage is in a globally shared read-only directory > /ext/sage/sage- and permissions

[sage-support] Re: problem with matrix over finite field

Hi Dima, On 2019-07-12, Dima Pasechnik wrote: > Hi Simon, > isn't MeatAxe interfaced via a library, rather than via files?! > Doing arithmetics on small matrices storing them on a disk is insanely > inefficient... Maybe. Do you mean one should instead compute a new multiplication table in

[sage-support] Re: problem with matrix over finite field

Hi Harald, On 2019-07-12, Harald Schilly wrote: > On Friday, July 12, 2019 at 11:48:40 AM UTC+2, Simon King wrote: >> >> sage: DOT_SAGE >> '/home/king/.sage/' > > It's > > sage: DOT_SAGE > '/home/user/.sage/' Do you literally mean "user"

[sage-support] Re: problem with matrix over finite field

Hi Hal, On 2019-07-11, Hal Snyder wrote: > sage: a = var('a') > : matrix(GF(25, a), [[1,0], [0, 1]]) > : > p025.zzz: No such file or directory > --- > RuntimeError Traceback (most recent

[sage-support] Re: need help in entering the values of trigonometric functions

Hi, On 2019-06-24, Prof K.A.Venkatesh wrote: > 1. how to enter cot(pi*x)? Did you try to type cot(pi*x) after the Sage prompt? The result is indeed cot(pi*x) as a symbolic expression. It can be evaluated by inserting special values for x (which is a pre-defined symbolic variable). A nice

[sage-support] Re: How to define variables over integer

Hi Santanu, Am Mittwoch, 8. Mai 2019 15:15:06 UTC+2 schrieb Santanu: > > I know how to define variables over BooleanPolynomialRing. > This is as follows. > > n=4 > V=BooleanPolynomialRing(n+1,['z%d'%(i) for i in range(n+1)] ) > V.inject_variables() > The above is what you could do *in an

[sage-support] Re: A case of immaculate conception...

Hi John, On 2019-03-20, john_perry_usm wrote: > ... > > 2) In Catholic theology it is not actually "necessary" for Mary to be free > of original sin; rather, it is "fitting". Right, "fitting" may be the better wording. And concerning the necessity of the doctrine of immaculate conception: 13th

[sage-support] Re: A case of immaculate conception...

Hi Emmanuel, On 2019-03-20, Emmanuel Charpentier wrote: > Nice one, Simon ! I'm sorely tempted to mark is as "best answer":-)... No, it was off-topic. But when a question is raised, I generally try to answer. Cheers, Simon -- You received this message because you are subscribed to the Google

[sage-support] Re: A case of immaculate conception...

On 2019-03-20, Deepak Pawar wrote: > looking for the plotting tutorials in 2D and 3D in sagemath. Can anyone > suggest me the good resources or link for the same? Hi Deepak, this thread is about a totally different topic. Next time please open a new thread when you want to discuss a new topic.

[sage-support] Re: A case of immaculate conception...

Hi Henri, On 2019-03-19, henri.gir...@gmail.com wrote: > What is the difference between virginal conception and immaculate > conception ? "Virginal conception" in the context of Christian dogmatics concerns how Jesus was conceived. "Immaculate conception" concerns how Jesus' *mother* was

[sage-support] Re: A case of immaculate conception...

Hi Isuru, On 2019-03-19, Isuru Fernando wrote: > If the sage preparser did something like, > > __tmp__ = SR.var("x, y"); __tmp_g__ = lambda x, y: > symbolic_expression(x+y**Integer(2)).function(x,y); f = __tmp_g__(*__tmp__) > > for > > f(x, y) = x + y ** 2 > > you wouldn't have this problem and

[sage-support] Re: A case of immaculate conception...

Hi Emmanuel, On 2019-03-19, Jeroen Demeyer wrote: > On 2019-03-19 12:52, Emmanuel Charpentier wrote: >> Defining a symbolic function seems to declare its arguments. > > I tend to think that everything on the left of the '=' sign in an > assignment is stuff that is assigned to. So > >(a, b,

[sage-support] Re: simplification options

Hi Michael, On 2019-03-11, Michael Beeson wrote: > I tried various simplification functions.I suppose I could start over, > not using "symbolic expressions" but > declaring K to be a suitable field or ring, maybe a quadratic extension of > the field of rational functions in a. > That is

[sage-support] Re: groebner basis algorithm: intended way of calling (out of other method)

On 2019-02-08, Daniel Krenn wrote: > Which algorithm does not return a *reduced* Gröbner basis? Singular has some options that determine whether or not a reduced GB is returned. I simply don't know (and have at the moment no time to look at the code) whether this option is used. Also, IIRC,

[sage-support] Re: groebner basis algorithm: intended way of calling (out of other method)

Hi Daniel, On 2019-02-08, Daniel Krenn wrote: > Let I be an ideal. Then I might want to compute something involving > Groebner basis, e.g. computing I.variety(). > Now suppose one wants to select a particular algorithm for the > computation of the Groebner basis. Then (due to caching) I use

[sage-support] Re: taylor versus series

Hi Peter, On 2018-12-30, Nils Bruin wrote: >> Does this only work in interactive mode? As soon as I try to >> capture it in a function it doesn't work anymore. The syntax R. = QQ[[]] only works interactively. In an interactive session, a preparser is adding some syntactical sugar: sage:

[sage-support] Re: taylor versus series

Hi Nils, On 2018-12-30, Nils Bruin wrote: > In the mean time, you can accomplish your computations without using SR: > > sage: R.=QQ[[]] > sage: (1 - x - sqrt(1 - 6*x + x^2))/(2*x) > 1 + 2*x + 6*x^2 + 22*x^3 + 90*x^4 + 394*x^5 + 1806*x^6 + 8558*x^7 + > 41586*x^8 + 206098*x^9 + 1037718*x^10 +

[sage-support] Re: taylor versus series

PS: On 2018-12-30, Simon King wrote: > It surprises me that .series(x,6) has a pole (after all, LargeSchroeder's > discontinuity in x=0 seems removable), so perhaps it's a bug, but > perhaps it's a feature after all --- I cannot tell from the documentation > if it is intended o

[sage-support] Re: taylor versus series

Hi Peter, On 2018-12-30, Peter Luschny wrote: > With Sage 8.4: > LargeSchroeder = SR((1 - x - sqrt(1 - 6*x + x^2))/(2*x)) Putting "SR" around the expression probably isn't needed, as by default x is a symbolic variable (of course this doesn't hold if you have defined x to be something

[sage-support] Re: Function defined with matrices won't plug in values for function

On 2018-12-15, Simon King wrote: > It's not an error but a warning. The absence of a warning doesn't mean > that the result is more trustworthy than a result of a computation that > doesn't create a warning. Ooops, one negation too many. I meant to say: "The absence of a warnin

[sage-support] Re: Function defined with matrices won't plug in values for function

Hi Saad, sorry that it took long to answer; I thought others would reply sooner than I. On 2018-12-05, saad khalid wrote: > If I run it, it gives me results with the error: " > > UserWarning: Using generic algorithm for an inexact ring, which will probably > give incorrect results due to

[sage-support] Re: Solving recursion formula?

On 2018-12-09, Marc Mezzarobba wrote: > Simon King wrote: >> What about >> a more complicated recurrence, such as the one given by >> x_(n+1) = 1 + x_n*2/n >> Any chances to solve those and similar recurrences automatically? > > You can try sympy's rsolve() or M

[sage-support] Re: Solving recursion formula?

Hi Marc, On 2018-12-08, Marc Mezzarobba wrote: > In Sage itself, CFiniteSequence.closed_form() should be able to solve > linear recurrence with constant coefficients. Thank you! Indeed, after changing my search keyword from resursive to reccurrence, CFiniteSequence seemed to be the most

[sage-support] Re: Solving recursion formula?

Hi again, On 2018-12-07, slelievre wrote: > There's competition between the words "recursion" and "recurrence", > you might have had more luck with "recurr". I'll try to do search_def("recur"), then. However: > This should be possible using either SymPy, or FriCAS, > or the optional "Ore

[sage-support] Re: Solving recursion formula?

Hi Samuel, thank you for all the links! Best regards, Simon On 2018-12-07, slelievre wrote: > Fri 2018-12-07 13:56:34 UTC+1, Simon King: > >> Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...) >> recursively by x_{n+1}=f(x_n). >> >> Is

[sage-support] Solving recursion formula?

Hi! Let x_0 be given, let f be a function defining a sequence (x_0,x_1,...) recursively by x_{n+1}=f(x_n). Is there a tool in Sage that can (at least in sufficiently simple cases) deduce a closed formula for x_n? I tried search_def('recurs'), but it revealed nothing I could recognise. Best

[sage-support] Re: Function defined with matrices won't plug in values for function

Hi Saad, as an algebraist I may be biased, but I have never understood why so many people try to use symbolics when they are not doing calculus. Calculus is a pancake, not a panacea (sorry for the bad joke). Without a joke: Quite many user questions can be answered in that way: "You try to

[sage-support] Re: Quaternions, how to speed up computation

Hi On 2018-11-19, Kolen Cheung wrote: > Then I thought I can import it in Python like this: > > import sage.rings > # OK > > sage.rings.polynomial.polynomial_ring.PolynomialRing_field > # AttributeError Admittedly the following is not an ideal solution, but you can do >>> from sage import

[sage-support] Re: Blue on black text

Hi "drl", you say that your text terminal's default is black background and dark blue text, and if I understand correctly, you don't like that Sage is using your own default color scheme. If your question is how to change the color scheme of your text terminal then I guess it depends on your

[sage-support] Re: "Is 1 zero or nonzero?"

Hi Chris, On 2018-10-23, Chris Judge wrote: > > Appears to be a bug that comes when integrating expression. > Maxima asks "Is 1 zero or nonzero?" and then suggests using assume(1>0). > Then it fails to accept this assumption... You just made my day... Coincidally, this week I told my students

[sage-support] Re: Integration bug?

On 2018-10-02, kcrisman wrote: > Please do. It's likely something related to > https://trac.sagemath.org/ticket/21440 and > https://trac.sagemath.org/wiki/symbolics#Integrationtickets where you can > browse to your heart's content :-) For some reason the wrong branch seems > to get chosen by

[sage-support] Integration bug?

Hi! I get the following with sage-8.4.beta5: sage: f(x) = cos(pi*x) sage: (f(x)*exp(-I*pi*x)).integral(x)(x=1/2) - (f(x)*exp(-I*pi*x)).integral(x)(x=-1/2) 1/2 sage: (f(x)*exp(-I*pi*x)).integral(x,-1/2,1/2) 1 The previous two expressions are not equal, but I think they should be equal.

[sage-support] Re: Accessing group generators in libgap

Hi Dima, On 2018-09-30, Dima Pasechnik wrote: > it was written before optional parameters era in GAP, as far as I know. > Anyhow, you can use GAP's PushOptions() and PopOptions() to achieve more or > less > the same effect, with a big uglier syntax. "Uglier" only internally. I think it

[sage-support] Re: Accessing group generators in libgap

On 2018-09-30, Simon King wrote: > D) libgap's and gap's methods should have roughly similar semantics That said: Of course I see the point of designing the libgap interface in the way it was done: libgap(X), where X is something in Sage, should return something in libgap that corresponds t

[sage-support] Re: Accessing group generators in libgap

Hi Vincent, On 2018-09-30, Vincent Delecroix <20100.delecr...@gmail.com> wrote: > The main problem is that G is a gap group and not a libgap > group. By gap group I mean that the interface going through > the pexpect interface. The two systems gap and libgap do not > seem to share the namespaces

[sage-support] Re: Accessing group generators in libgap

Here is another question on libgap: Let some libgap elements be given; how to form the list of these elements in libgap? The purpose would, for example, be to create a group from that list. For instance: sage: G = gap.SmallGroup(48,36) sage: g1,g2,g3,g4,g5 = G.GeneratorsOfGroup() Since G

[sage-support] Accessing group generators in libgap

Hi! Define sage: G = libgap.eval('Group([(3,4,5,6,7,8,9,10),(1,2)])') (By the way, why does libgap.Group([(3,4,5,6,7,8,9,10),(1,2)]) not work?) In Gap, also in gap-via-pexpect, one can access the i-th generator of a group (the count starts with 1) in the form G.i, but unfortunately this

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Dima Pasechnik wrote: > How many (single) cosets are you talking about? > Once you have a permutation representation, these double coset > computations are very fast. > I am almost sure GAP first enumerates (single) cosets, anyway. There are 7 double cosets, but

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Dima Pasechnik wrote: > I believe making libGAP the default GAP interface is the way to go, and > much of the work needed for this conversion is already done... > > libgap's GAP objects are just thin cython wrappers around GAP's objects in > memory. > So you basically

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Dima Pasechnik wrote: > On Sat, Sep 29, 2018 at 9:58 AM Simon King wrote: >> >> On 2018-09-29, Simon King wrote: >> > Too bad: When the error occurs and I adjust the pool size then >> > afterwards the previously defined objects in gap a

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Dima Pasechnik wrote: > There is no real harm in doing > set_gap_memory_pool_size(10*get_gap_memory_pool_size()) Yes, there is (see my other post). The computation takes much much longer than in libgap. > If coset enumeration is the bottleneck, you should not use GAP's

[sage-support] Re: Problem with Sage's pexpect interface to Gap

On 2018-09-29, Simon King wrote: > Too bad: When the error occurs and I adjust the pool size then > afterwards the previously defined objects in gap are gone. Additional problem: Even when I increase the memory limit sufficiently, gap-via-pexpect takes substantially longer than libgap to c

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Simon King wrote: > Anyway, using set_gap_memory_pool_size(2*get_gap_memory_pool_size()) > till everything works sounds like a reasonable way out. Too bad: When the error occurs and I adjust the pool size then afterwards the previously defined objects in gap ar

[sage-support] Re: Problem with Sage's pexpect interface to Gap

Hi Dima, On 2018-09-29, Dima Pasechnik wrote: > set_gap_memory_pool_size() > controls the amount of memory GAP and libGAP get if started from Sage. > The latter is dynamic, as opposed to "sage --gap" Do I understand correctly: libgap has dynamic pool size, but gap-via-pexpect has not? That

[sage-support] Re: Problem with Sage's pexpect interface to Gap

to libgap.eval('foo'), not to libgap('foo'). My preferred solution, however, would be to enable gap-via-pexpect. How? Best regards, Simon On 2018-09-29, Simon King wrote: > Hi! > > Let G be the third Conway group, S its Sylow 2-subgroup, and > N the normaliser of the centre of S i

[sage-support] Problem with Sage's pexpect interface to Gap

Hi! Let G be the third Conway group, S its Sylow 2-subgroup, and N the normaliser of the centre of S in G. Gap is able to compute the list of double coset representatives of N in G using the command gap> DC := DoubleCosetRepsAndSizes(G,N,N);; gap> Length(DC); 7 Actually, if I

[sage-support] Re: solving equations with parameters

Hi Dominique, On 2018-08-13, Dominique Laurain wrote: > PS : use asksagemath.org -1! There are people (I, for instance) who hate the guts of ask.sagemath.org. Seriously, I find the whole system of badges and tags and colourful symbols and embedded editors both distracting and discouraging. I

[sage-support] Re: Can a module suddenly disappear?

for it. Best regards, Simon On 2018-07-30, Simon King wrote: > > To add to my confusion: > > I also have p_group_cohomology installed, which makes extensive use of > matrix_gfpn_dense. And it still works. More precisely, when I import > something from the cohomology pack

[sage-support] Re: Can a module suddenly disappear?

eck is going on there? Best regards, Simon On 2018-07-30, Simon King wrote: > Hi! > > I just met a quite troublesome problem: I have MeatAxe installed in > Sage, and thus the optional extension sage.matrix.matrix_gfpn_dense was > available - till 30 minutes ago (I am sure that it w

[sage-support] Can a module suddenly disappear?

Hi! I just met a quite troublesome problem: I have MeatAxe installed in Sage, and thus the optional extension sage.matrix.matrix_gfpn_dense was available - till 30 minutes ago (I am sure that it was available, as I did some timings with it). Suddenly, after restarting Sage, the module has gone,

[sage-support] Re: problems installing sage on ubuntu 18.04

Hi Rudolf, On 2018-07-26, rudolf ordoyne wrote: > my guess is that i'm unable to install sage since the most recent release > of sage is for 16.04. after unpacking the .tar, running "sudo ./sage" > gives "sudo: ./sage: command not found" What exact tar ball are you talking about? If you did

[sage-support] Re: Parallel computation in Sage

PS: I don't know if `algorithm='padic'` would use a parallel computation. It would certainly make sense. Am Montag, 16. Juli 2018 18:08:07 UTC+2 schrieb Simon King: > > Hi Chandra, > > Am Montag, 16. Juli 2018 07:33:03 UTC+2 schrieb chandra chowdhury: >> >> I want to c

[sage-support] Re: Parallel computation in Sage

Hi Chandra, Am Montag, 16. Juli 2018 07:33:03 UTC+2 schrieb chandra chowdhury: > > I want to calculate the determinant of a large matrix > with large entries. So it is taking time. In my machine, > I have 32 CPUs. Is it possible in Sage to use all CPUs > parallelly to find the determinant? >

[sage-support] Re: Problem in new Sage version

On 2018-07-10, slelievre wrote: > you have the choice between the following: > > sage: V = PolynomialRing(GF(2), 49, xxz) > ... > sage: V = BooleanPolynomialRing(49, xxz) I think that's a very dangerous statement, as the boolean polynomial ring is a *quotient* of the above polynomial

[sage-support] Re: Cython in jupyter notebook

Hi Nils, On 2018-04-15, Nils Bruin wrote: > The quickest workaround for now is to just eliminate the whole error > redirection. We didn't have it before either. If you have control over the > distribution you use to teach, that might get you through your lecture. Indeed I'll

[sage-support] Re: Cython in jupyter notebook

Hi Nils, On 2018-04-15, Nils Bruin wrote: > ... > where this code was committed: > > try: > # Capture errors from distutils and its child processes > with open(os.path.join(target_dir, name + ".err"), 'w+') as errfile: > try: > with

[sage-support] Cython in jupyter notebook

Hi! The following cython code compiles fine in SageMath command line version and it *used* to compile fine in the jupyter notebook one year ago: cython(""" def mantisse(): cdef double a = 1 cdef double b = 2 cdef int i = 0 while True: a += b**(-i)

[sage-support] Re: Graph canonical form directly on matrices

Dear Christian, On 2018-03-07, Christian Stump wrote: > Anyway, looking at sage/graphs/bliss.pyx, it seems easy to modify your >> code to directly create a bliss graph. >> > > Help there is highly appreciated :-), I don't know how to do that > appropriately... Just

[sage-support] Re: Graph canonical form directly on matrices

On 2018-03-07, Dima Pasechnik wrote: > Ultimately, the classical canonical form/isomorphism implementations run on > (di)graphs represented by 0-1 matrices, often > with bit entries. So that's how bliss_digraph is represented too. > Constructing it directly might be

[sage-support] Re: Graph canonical form directly on matrices

PS: On 2018-03-06, Simon King <simon.k...@uni-jena.de> wrote: > On 2018-03-06, Christian Stump <christian.st...@gmail.com> wrote: > I haven't really been able to work around the bottle neck, but got a > minor improvement (4%) as follows: > ... > And of course

[sage-support] Re: creating regular representation for the quotient ring over a 0-dimensional ideal

Hi Dima, On 2018-03-05, Dima Pasechnik wrote: > I need to do computations with matrices representing elements of the > quotient ring A of a polynomial ring k[x1,...,xn] modulo a 0-dimensional > ideal. > I don't seem to find such basic functionality as constructing these >

[sage-support] Re: Find_root not finding a root

Hi Khalid, On 2018-03-02, saad khalid wrote: > I'm running this code: > find_root(e^(-2*x*1)-(1 - 4*x),-2,2) > > It returns > > 2.4011774461136836e-13 > > which is approximately 0. However, there should be another root around x = > -0.628. Why isn't it finding this root? >

[sage-support] Re: Is this a bug?

On 2018-02-28, Ralf Stephan wrote: > On Wednesday, February 28, 2018 at 9:09:04 AM UTC+1, Dima Pasechnik wrote: >> >> I would be for dropping 'x' as the only "default" variable (defined at >> start time). >> > > I agree but does it solve the problem I demonstrated. Can you

[sage-support] Re: Is this a bug?

Hi Ralf, On 2018-02-28, Ralf Stephan wrote: > The reason is apparently that the polynomial ring was not created by the > user on the command line but by the charpoly() code. The parent of the pre-defined variable x wasn't created by the user either, so, please don't blame

[sage-support] How to get special values of arccos

Hi! SageMath knows a couple of special values for the cosine function, such as sage: cos(pi/8) 1/2*sqrt(sqrt(2) + 2) However, SageMath's knowledge of special values of the arccos function seems a lot more limited: sage: arccos(_) arccos(1/2*sqrt(sqrt(2) + 2)) sage: arccos(1/2) 1/3*pi

[sage-support] Re: Fwd: Re: Re: numpy

Hi, On 2018-01-09, Girard Henri wrote: > Am 09.01.2018 um 12:18 schrieb Girard Henri: >> An exemple >> >> from matplotlib import pyplot as plt >> from scipy.io import wavfile >> import numpy as np >> samplerate,data=wavfile.read("test.wav") >>

[sage-support] Re: numpy

Hi, On 2018-01-09, Girard Henri wrote: > I would like to know how to make this command numpy : > > import numpy as np > > times=np.arange ? What do you mean by "make this command"? numpy is included in SageMath. Therefore, import numpy as np times = np.arange just

  1   2   3   4   5   6   7   8   9   10   >