Ask Your Question

John Palmieri's profile - activity

2024-07-16 20:52:24 +0200 commented question How to use GF() on a very large finite field ?

The number in your comment is not a prime power, so GF(...) is not defined. Perhaps it doesn't complete because it's fir

2024-07-16 20:51:44 +0200 commented question How to use GF() on a very large finite field ?

The number in your comment is not a prime power, so GF(...) is not defined.

2024-07-08 22:43:51 +0200 answered a question what primality test is used by "is_prime" function over the integer in sage math?

According to the Sage reference manual, this method calls "the PARI function isprime". That function is documented here;

2024-07-08 00:27:37 +0200 commented question List of all invariant factors (finite abelian groups)

I could be wrong, but I don't think there is a built-in function. Using n=48 (for example) and n.factor() and the ideas

2024-07-04 02:43:00 +0200 received badge  Nice Answer (source)
2024-07-01 03:46:46 +0200 answered a question how to display the list of all monomials occurring in a polynomial

(f^2).monomials() works. If you do g=f^2 and then type g.<TAB>, you will get a list of methods attached to g, one

2024-06-30 00:05:30 +0200 commented answer cohomology difference C2 C3

When you say that C2 is the surface of C3, do you mean that C2 is the boundary of C3? If so, then I think that the bound

2024-06-28 20:18:32 +0200 commented answer cohomology difference C2 C3

If you want help figuring out what's going on, please provide a minimal example that illustrates the issue. You have mor

2024-06-28 15:59:45 +0200 received badge  Nice Answer (source)
2024-06-26 19:21:09 +0200 answered a question Vector field plot of python function

When you pass g(x) as an argument, since g is a Python function, it tries to evaluate the function. It then can't tell w

2024-06-25 23:15:25 +0200 answered a question cohomology difference C2 C3

Why would you expect them to be the same? I am not able to read all of your code and understand what it does, but: cubi

2024-06-22 20:36:24 +0200 commented answer How to calculate the facet with respect to the product of simplicial complexes

If you run T.facets?, you will get documentation, the first line of which is "The maximal faces (a.k.a. facets) of this

2024-06-22 19:38:24 +0200 answered a question How to calculate the facet with respect to the product of simplicial complexes

S consists of two 1-simplices: two edges. W is a single edge. Their product, therefore, consists of two squares: [0,1] x

2024-06-22 19:35:53 +0200 edited question How to calculate the facet with respect to the product of simplicial complexes

How to calculate the facet with respect to the product of simplicial complexes I began to learn topology with respect to

2024-06-22 18:16:12 +0200 commented question A problem in outputting a list

I'm closing this as a duplicate of https://ask.sagemath.org/question/77949/a-problem-in-outputting-a-list/

2024-06-12 18:38:50 +0200 commented question Building documentation raises error 'no module named sage_autodoc'

Maybe version 4.3.2 of Sphinx is too old and you need to upgrade?

2024-06-09 20:35:07 +0200 commented question Building documentation raises error 'no module named sage_autodoc'

Just a guess: if you run sage --buildsh first, that will start a new shell with various environment variables set, and t

2024-05-29 22:20:32 +0200 answered a question Rank of Homology Groups?

You can use the invariants method: sage: K = simplicial_complexes.KleinBottle() sage: H = K.homology(1) sage: H.invaria

2024-05-23 02:20:00 +0200 commented question SageMath language changes since 10.1

Also, summaries of changes from one version to the next are available at https://wiki.sagemath.org/ReleaseTours.

2024-05-23 02:18:09 +0200 commented question SageMath language changes since 10.1

Those terms should still be available. What platform are you using and how did you install SageMath?

2024-05-23 02:17:52 +0200 commented question SageMath language changes since 10.1

Those terms should still be available. What platform are you using and how did you install SageMath? Note also that vers

2024-05-23 02:17:42 +0200 commented question SageMath language changes since 10.1

Those should still be available. What platform are you using and how did you install SageMath? Note also that version 10

2024-05-20 23:38:28 +0200 edited question is this a bug?

is this a bug? The code: sage: a 3 sage: b 8 sage: c 7 sage: t = (a*a + b*b - c*c)/(2.0 *a*b) sage: acos(t) 1.047197551

2024-05-20 23:38:15 +0200 edited question is this a bug?

is this a bug? sage: a 3 sage: b 8 sage: c 7 sage: t = (aa + bb - cc)/(2.0 *ab) sage: acos(t

2024-05-15 23:09:15 +0200 commented question how to fix build error in sagemath 10.3 on fedora 40 GNOME: failed to build ppl-1.2.p1GNOME

You could also look at the file config.log to see why it did not use your system installation of ppl. Search for "Checki

2024-05-15 21:44:46 +0200 commented answer From this collection, I want to find (if there is any) three matrices A,B,C satisfying A+B=C

In the case of $A^3=A$, you will obviously get the solutions where $A=0$ and $B=C$.

2024-05-15 21:41:46 +0200 commented answer From this collection, I want to find (if there is any) three matrices A,B,C satisfying A+B=C

You can also use brute force and just list all of the solutions to $A^3=I$, if you're willing to work mod 3. Then since

2024-05-15 20:14:53 +0200 commented question Peculiarities of Help in Jupyter?

Please provide details.

2024-05-14 18:07:34 +0200 commented question Installing Coxeter3

Please provide more details: what OS are you using, what version of Sage, and how did you install it?

2024-05-10 20:54:52 +0200 commented question It's not working qepcad

The error message is consistent with what I get when I don't have qepcad installed.

2024-05-09 04:30:24 +0200 commented question Installing Coxeter3

Try sage -f coxeter3 (lowercase, not capital).

2024-05-06 19:11:41 +0200 commented question Easy way to round polynomial coefficients?

Your question is not clear. What meaningful conversion will turn 2.67e493 into 2.67 and also turn 1.93e247 into 1.93? Yo

2024-05-02 19:53:18 +0200 answered a question Functions source code

Two options: (1) as @MaxAlekseyev says, use ?? either before or after the item in question: ??G.is_isomorphic or G.is_is

2024-04-30 20:56:20 +0200 commented question How to generate map in sage

The completion method does not introduce inverses of the generators, but (I expect) only inverses of elements with nonze

2024-04-28 04:46:29 +0200 answered a question Is it possible to return the grade of a multivector?

You can recover the degree of an element using the degree method. Your element u is not homogeneous, so u.degree() raise

2024-04-26 23:48:19 +0200 edited question Size of objects shown in animations

Size of objects shown in animations Hi, a series of 3d objects looks OK in the notebook, when shown in a loop with repea

2024-04-26 00:12:35 +0200 commented question How should I use the numerical method .n()?

In response to the specific question at the end: [(sin(t)*exp(t)).n() for t in srange(0,10,0.01)] == [sin(t).n()*exp(t).

2024-04-16 13:10:23 +0200 received badge  Nice Answer (source)
2024-04-15 18:10:36 +0200 answered a question Combinatorial elements and classes

The command import_statements will tell you how to import something: sage: import_statements('CombinatorialElement') fr

2024-04-13 22:50:25 +0200 commented answer How set and especially clear bits?

Or ~(1r << n): no need for int if you're using r. Of course any of these it may overflow if n is too large.

2024-04-13 22:48:18 +0200 commented answer How set and especially clear bits?

Or ~(1r << n): no need for int if you're using r.

2024-04-13 19:37:40 +0200 commented answer How set and especially clear bits?

I think it suffices to just convert 1 to an int: ~(int(1) << n).

2024-03-26 05:44:23 +0200 edited question How to generate this map in sage

How to generate this map in sage Okay this is my code so far. F.<x,y,z> = FreeGroup() A = F.algebra(QQ) Y = A(y)

2024-03-11 19:51:17 +0200 edited question the plot of my function EFF is always zero, but print

the plot of my function EFF is always zero, but print The code: sage: cnodo=[] sage: cnodo.append(0) sage: cnodo.append

2024-03-11 19:51:03 +0200 edited question the plot of my function EFF is always zero, but print

the plot of my function EFF is always zero, but print sage: cnodo=[] sage: cnodo.append(0) sage: cnodo.append(.5

2024-03-07 18:06:22 +0200 received badge  Nice Answer (source)
2024-03-05 20:00:01 +0200 edited answer Functions of the elements of a matrix

Yes, you can certainly create a function in Python that operates on a matrix in the manner you described. You don't need

2024-03-04 23:15:40 +0200 commented answer How to solve system of equations in polynomial ring over GF with a different variables

(I was basing this on the comment "I expected solution x = 3 * y, z = 6 * y".)

2024-03-04 19:17:05 +0200 commented answer How to solve system of equations in polynomial ring over GF with a different variables

Maybe J.gens() is the kind of thing the poster is looking for?

2024-03-04 18:50:14 +0200 answered a question How to solve system of equations in polynomial ring over GF with a different variables

The solve_mod command might be useful: Return all solutions to an equation or list of equations modulo the given int