2021-07-26 22:30:45 +0200 | received badge | ● Nice Answer (source) |

2021-07-21 11:21:18 +0200 | received badge | ● Notable Question (source) |

2021-07-21 11:19:52 +0200 | commented question | Finite categories? Hi David. Sounds like a nice project. You might also want to ask on sage-devel. |

2021-07-17 09:59:54 +0200 | commented question | polynomial multiplication is unexpectedly slow Probably you should use somewhere that the a[i] are roots; currently they don't satisfy any non-trivial polynomial equat |

2021-07-14 11:31:38 +0200 | commented answer | Polynomial system without solution in char. 0: classification of char. p with solution Congratulations! |

2021-07-14 11:21:48 +0200 | answered a question | Boolean Polynomial Ring It seems that the BooleanPolynomialRing constructor doesn't accept a map object as a list of variable names, only string |

2021-07-12 22:45:54 +0200 | commented question | I've got a big expression I need to dissect a certain way Can you convert it to an element of a polynomial ring? (Or better yet, create it as such in the first place.) Then it's |

2021-07-12 22:40:43 +0200 | commented question | I've got a big expression I need to dissect a certain way Can you convert it to an element of a polynomial ring? Then it's easy. Please post some of the terms, to make the questi |

2021-07-06 16:00:24 +0200 | received badge | ● Good Answer (source) |

2021-07-06 15:48:04 +0200 | received badge | ● Nice Answer (source) |

2021-07-06 13:21:14 +0200 | answered a question | How to check that field is Number Field See the category of number fields: sage: NumberField(x^2 + 1, 'a') in NumberFields() True |

2021-07-05 19:57:05 +0200 | edited answer | fixed subfield of cyclotomic field Here you go: m = 5 Zm = Zmod(m) L = [Zm(1), Zm(-1)] K.<z> = CyclotomicField(m) power_list = [z^k for k in range(m |

2021-07-05 19:53:35 +0200 | answered a question | fixed subfield of cyclotomic field Here you go: m = 5 Zm = Zmod(m) L = [Zm(1), Zm(-1)] K.<z> = CyclotomicField(m) power_basis = [z^k for k in range( |

2021-06-29 20:54:51 +0200 | received badge | ● Nice Answer (source) |

2021-06-29 15:00:25 +0200 | answered a question | differential equation Indeed, if you want to plot $g(x)$, the expression $g(x)$ should evaluate to a number when $x$ is a number. You correctl |

2021-06-26 02:32:33 +0200 | received badge | ● Good Answer (source) |

2021-06-25 16:57:42 +0200 | answered a question | Is parallel computation with mpi4py still supported? You can install openmpi using your system's package manager, and run sage -pip install mpi4py to install mpi4py. The |

2021-06-25 12:27:48 +0200 | commented question | Is parallel computation with mpi4py still supported? Also, to use Sage stuff in your Python script you should do import sage.all first. Then the above instructions seem to w |

2021-06-25 12:07:21 +0200 | commented question | Is parallel computation with mpi4py still supported? The optional mpi4py package was deleted because it didn't build with Python 3 back then. That is already long ago, and m |

2021-06-23 23:22:50 +0200 | commented answer | how can I manipulate a multiplicative group of Zmod(n) Indeed, H.gen(0).parent() is G being True seems fishy. |

2021-06-23 21:40:05 +0200 | received badge | ● Nice Answer (source) |

2021-06-23 20:27:51 +0200 | commented question | how can I manipulate a multiplicative group of Zmod(n) There seems to be a bug in the subgroup method: H should consist of [1, f^2, f^4]. Edit: this assumed the f in H is the |

2021-06-23 20:27:37 +0200 | commented question | how can I manipulate a multiplicative group of Zmod(n) There seems to be a bug in the subgroup method: H should consist of [1, f^2, f^4]. Edit: this assumed the f in H is the |

2021-06-23 19:51:20 +0200 | commented answer | Verbose option for interreduced_basis() function? You're welcome! I just changed the name of the function because it's really calculating a reduced Groebner basis. Anyway |

2021-06-23 19:48:05 +0200 | edited answer | Verbose option for interreduced_basis() function? It seems like there is no such option. However we can program it ourselves: from sage.misc.verbose import verbose def |

2021-06-23 19:42:58 +0200 | commented question | how can I manipulate a multiplicative group of Zmod(n) There seems to be a bug in the subgroup method: H should consist of [1, f^2, f^4]. |

2021-06-23 18:48:48 +0200 | received badge | ● Nice Answer (source) |

2021-06-23 17:57:10 +0200 | answered a question | Verbose option for interreduced_basis() function? It seems like there is no such option. However we can program it ourselves: from sage.misc.verbose import verbose def |

2021-06-16 16:26:28 +0200 | received badge | ● Good Answer (source) |

2021-06-16 10:26:12 +0200 | commented answer | Building a homomorphism from group algebra to matrix space For implementing this in SageMath I opened https://trac.sagemath.org/ticket/31989 |

2021-06-16 09:45:10 +0200 | received badge | ● Nice Answer (source) |

2021-06-15 21:29:41 +0200 | commented question | Thue-Mahler equation It seems not. There is Magma code in the master's thesis Implementation of a Thue-Mahler equation solver by Kyle Hambroo |

2021-06-15 20:38:47 +0200 | answered a question | Building a homomorphism from group algebra to matrix space I'm not sure why this hasn't been implemented in SageMath. It's probably an oversight rather than being due to any diffi |

2021-06-15 17:53:27 +0200 | received badge | ● Nice Answer (source) |

2021-06-15 14:37:46 +0200 | answered a question | Problem by finding an integral The SageMath result (output of your code in SageMath 9.2) has coefficient a $2/5$ instead of the $2/15$ you claim: sage |

2021-06-11 23:00:15 +0200 | commented question | Can we avoid to fall back to very slow toy implementation in the computation of Groebner basis under a finite field of large characteristic? The limitation is probably due to Singular having that limitation. Maybe try CoCoA. |

2021-06-11 22:21:16 +0200 | received badge | ● Good Answer (source) |

2021-06-11 08:09:39 +0200 | received badge | ● Nice Answer (source) |

2021-06-11 04:40:23 +0200 | received badge | ● Necromancer (source) |

2021-06-11 04:35:35 +0200 | received badge | ● Nice Answer (source) |

2021-06-10 11:50:57 +0200 | answered a question | how to define symbolic function on functions? The reason for the results is that callable symbolic expressions are defined by interpreting the input variables as symb |

2021-06-10 11:36:56 +0200 | answered a question | solving for the center of the real quaternions You can use polynomial rings over polynomial rings: A.<a1,b1,c1,d1> = PolynomialRing(QQ, order='lex') B.<a2,b2 |

2021-06-10 01:23:21 +0200 | received badge | ● Nice Answer (source) |

2021-06-09 23:35:33 +0200 | commented question | What does SageMath use to create the pattern when planes overlap? The program used to display this is three.js, so this is more of a question for them (e.g. (M+N).show(viewer='tachyon') |

2021-06-09 23:28:37 +0200 | answered a question | how to bold and embiggen variable using latex_name You can define P = var('P', latex_name=r'\pmb{\mathscr{P}}'), which displays as $\pmb{\mathscr{P}}$. |

2021-06-09 23:15:17 +0200 | answered a question | How to interpret Solve_ineq() result ? This seems to be a bug in Maxima, now reported as #3799 fourier_elim returns non-(in)equations. |

2021-06-09 07:44:33 +0200 | answered a question | Finding Schur coefficient of a concrete polynomial I don't know why this conversion isn't implemented. But you can use the from_polynomial method instead: sage: s.from_po |

2021-06-02 23:22:47 +0200 | answered a question | Multivariate Polynomial Ring +1 variable You can do conversion: R(g) or g = R(g) However it is often better to avoid the symbolic ring altogether, if possi |

2021-05-30 18:33:35 +0200 | answered a question | Computing Ray class numbers? In the past 8 years there have been some changes to SageMath, so it is understandable that this code no longer works. Th |

2021-05-27 12:05:08 +0200 | answered a question | Evaluation of Boolean function at a point. A single argument consisting of a list or a tuple is not accepted as input. Only keyword arguments or n positional argum |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.