John Palmieri's profile - activity

I think it's just a sign that it can't find a solution. There are similar examples in the documentation given by solve?,

What happens if you do: import subprocess; subprocess.run(["msolve", "-h"]) ?

Are any of the benchmarking tools helpful? https://doc.sagemath.org/html/en/reference/misc/index.html#benchmarking-and-p

As long as homebrew is available for the machine, the build process might not be too bad.

I'm guessing that with such old hardware, you are probably better off trying to build Sage yourself. The appropriate pla

For what it's worth, I installed the binary version of Sage, built and installed msolve as you describe, and it works on

Within Sage on the Mac, what happens if you evaluate !echo $PATH? Is /usr/local/bin included, because I think that's whe

Within Sage on the Mac, what happens if you evaluate !echo $PATH? Is /usr/local/bin included, because I think that's whe

My guess is that /usr/local/bin is not in the user's PATH, but that's where msolve was installed. To repair this: Wit

(Or equivalently, evaluate os.environ['PATH'].)

Within Sage on the Mac, what happens if you evaluate !echo $PATH? Is /usr/local/bin included, because I think that's whe

When you initialize a CombinatorialFreeModule, you can specify a category, and if you specify a category of algebras, th

Perhaps better than search_src('def tetrahedron') would be search_def('tetrahedron'): search_def is designed to search f

What happens when you use ./bootstrap && ./configure && make instead of ./sage -br?

With the example you started with: K = SimplicialComplex([[0, 1], [1, 2], [2, 0]]) C1 = K.n_chains(1) Then C1 is Fre

What version of Sage are you trying to install? When installing Xcode, did you install the command-line tools (I don't r

One approach is to do this: R.<x> = QQ[x] I = R.ideal(cyclotomic_polynomial(27)(x)) R27.<a> = R.quotient(I)

Multiplication in Polynomial Rings I am attempting to use substitute elements in a quotient ring into a formula and then

I've created https://github.com/sagemath/sage/issues/40469 along with a proposed fix at https://github.com/sagemath/sage

I think the problem is the line https://github.com/sagemath/sage/blob/develop/src/sage/homology/chain_complex.py#L1368:

If you just want homology generators, this works for me: sage: K = SimplicialComplex([[0, 1], [1, 2], [2, 0]]) sage: K.

@MaxAlekseyev: the question was about plotting, not about this particular evaluation of the frac function. Sage does not

Here is what I see with sage-10.7.beta8: (For what it's worth, frac(-2.3) outputs -0.300000000000000.)

It works for me with the latest version of Sage (the two functions you provide have different plots, and frac is never n

I would also expect it to be the sum of the dimensions. @eric_g: what do you think?

For simplicial complexes, searching the source code for "matching" yields only one thing that might be related: simplici

I'm curious: might it be faster to compute everything in the polynomial ring, and then at the end convert the result to

How does this relate to stanley_reisner_ring? Is it just that the base ring is exterior rather than polynomial? The code

Testing if an object is a Matrix or a Vector For a long time I used : is_Matrix(A) is_Vector(B) but it is now depreca

Testing if an object is a Matrix or a Vector For a long time I used : is_Matrx(A) is_Vector(B) but it is now deprecat

Having trouble latex the crystal graph using sage, KeyError: 'node_1'? The inputs: K = crystals.KirillovReshetikhin(['A

You could define a new _add_ method for your class which calls the method for the superclass and then converts it to you

I'm guessing that the _add_ method, inherited from the superclass, returns something lying in that superclass. I think t

Actually, their code uses both n and N; I think it's the use of N in valuation(N,p) which causes the problem. Anyway, us

The factor method takes an algorithm keyword; have you looked at the documentation? In your case, since you know that t

First, I suggested first checking whether p.divides(a) before dividing. Second, I've provided some untested code to keep

The factor method takes an algorithm keyword; have you looked at the documentation? In your case, since you know that t

I think that you should ask questions about GSOC projects on the sage-gsoc Google group — see link at https://wiki.sagem

The factor method takes an algorithm keyword; have you looked at the documentation? In your case, since you know that t

Does it work if your file instead contains a smaller integer, say 5 digits?

You should add f.close() after writing to the file; otherwise, the write operation may not complete.

Is This A limitation of my Processing Power I'm trying to load a large number into Sage for factoring. I believe with t

Does it work if your file instead contains a smaller integer, something easily factorable, say 5 digits?

Also, what happens if you remove/modify the xmin and xmax arguments? Can you get the pictures you want?

These graphs looks fine when I look at them separately, so it looks more like an issue with graphics_array than the indi

Can you provide a toy example? Does your .txt file just contain something like "1023", or is there more in it than just

Term order is not defined for single-variable polynomial rings, just for multivariable rings: sage: R2 = PolynomialRing

How to print variables order of a polynomial ring? Hello, I've a generic multivariate polynomial ring, for which I need