2022-08-15 20:33:16 +0200 | commented question | solve causing headaches Not sure exaclty how solve works. Access its documentation with solve? and its source code with solve??. The optional |

2022-08-13 06:07:22 +0200 | edited answer | Cayley graph side error The parameter generators you are trying to pass to .cayley_graph() is not the first one (the first one is side), and thu |

2022-08-13 06:05:23 +0200 | edited question | Cannot use SageMath notebooks Cannot use SageMath notebooks I am having trouble using SageMath notebook. I think it all started when I was installing |

2022-08-12 10:35:45 +0200 | received badge | ● Good Answer (source) |

2022-08-11 22:31:52 +0200 | answered a question | How can I reduce the coefficients modulo a certain integer in a matrix of polynomials? Starting from an already defined matrix, use its change_ring method to produce a matrix over a different ring. Suppose |

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

2022-08-10 17:25:08 +0200 | edited answer | Checking whether a polynomial in unimodal Call C the list of coefficients, removing immediate repeats. Unimodality means there is no decrease-then-increase in C. |

2022-08-08 21:53:20 +0200 | commented question | Numerical Integration of complex functions It is nice to include an example that works. Can you also include one that does not work? |

2022-08-08 21:52:50 +0200 | commented question | Numerical Integration of complex functions Welcome to Ask Sage! Thank you for your question. |

2022-08-08 21:50:08 +0200 | answered a question | Compilation fails with "ModuleNotFoundError: No module named 'Cython'" To compile Sage but not its documentation, use: make build |

2022-08-08 21:30:02 +0200 | commented question | solve causing headaches @kwaddle -- thanks for providing concrete examples. I made some further edits: deleted some comments after you include |

2022-08-08 21:29:00 +0200 | edited question | solve causing headaches solve causing headaches I'm working with systems of 10 equations in 14 variables, and for such a system I'd like to know |

2022-08-08 13:56:43 +0200 | commented question | solve causing headaches @kwaddle -- thanks for providing concrete examples. I made some further edits: deleted some comments after you include |

2022-08-08 13:43:36 +0200 | edited question | solve causing headaches solve causing headaches I'm working with systems of 10 equations in 14 variables, and for such a system I'd like to know |

2022-08-08 08:37:56 +0200 | edited question | solve causing headaches solve causing headaches I'm working with systems of 10 equations in 14 variables, and for such a system I'd like to know |

2022-08-08 08:23:29 +0200 | edited question | solve causing headaches |

2022-08-04 22:47:14 +0200 | answered a question | How do I add missing functions? The height functions you refer to are available as methods of some objects, rather than as functions in the global names |

2022-08-04 22:39:15 +0200 | answered a question | Plot drops exponent when scientific notation appears on the y-axis Already reported several times, see for instance these related discussions: Sage Trac ticket 31447: list_plot labels d |

2022-07-28 11:29:52 +0200 | commented question | A sageCell question Can you be more specific as to what you are asking? |

2022-07-27 22:12:17 +0200 | edited answer | Comparing pari.numbpart() and sympy.partition() Both use the Hardy-Ramanujan-Rademacher formula, see: PARI/GP documentation for numbpart SymPy documentation for npart |

2022-07-27 22:11:56 +0200 | answered a question | Comparing pari.numbpart() and sympy.partition() Both use the Hardy-Ramanujan-Rademacher formula, see: PARI/GP documentation for numbpart SymPy documentation for npart |

2022-07-25 15:27:43 +0200 | answered a question | Matrix with negative indices Python uses negative indices to index from the end. So for a 3 by 3 matrix, you can think of the indices as 0, 1, 2 or |

2022-07-25 15:22:50 +0200 | commented question | How do I represent monomial reflection groups? Also asked as Math Stack Exchange question 4381306). |

2022-07-25 11:53:00 +0200 | commented answer | make PB when installing from source Provided /usr/local/bin is in your PATH (check that with echo $PATH), you can remove the line alias sage=... from ~/.bas |

2022-07-24 11:21:16 +0200 | received badge | ● Nice Answer (source) |

2022-07-24 09:20:32 +0200 | commented question | Polynomial from coefficient vector mod 2 Welcome to Ask Sage! Thank you for your question. |

2022-07-24 09:20:06 +0200 | answered a question | Polynomial from coefficient vector mod 2 Convert the vector to a tuple. Here is an example. Define the polynomial ring: sage: R.<x> = PolynomialRing(GF( |

2022-07-24 09:15:55 +0200 | edited question | Polynomial from coefficient vector mod 2 Polynomial from coefficient vector mod 2 I want to extract the polynomial over GF(2), whose coefficients correspond to a |

2022-07-24 07:55:27 +0200 | edited answer | Mittag-Leffler There does not seem to be an implementation in Sage. There is an implementation in R in the MittagLeffleR R package. |

2022-07-24 07:03:28 +0200 | commented question | Weyl character formula in Sagemath Note: also asked as Math Stack Exchange question 4353102: Weyl character formula in SageMath |

2022-07-24 06:50:43 +0200 | edited question | Why, in any equation, are repeated solutions given by Sage only once? Why, in any equation, are repeated solutions given by Sage only once? In the example var('f, q, r, h, i, g, x, y, z') e |

2022-07-23 18:54:41 +0200 | edited question | Why, in any system of equations, does Sage give repeated solutions only once? Why, in any system of equations, does Sage give repeated solutions only once? For example, the following system of equat |

2022-07-23 18:53:57 +0200 | answered a question | make PB when installing from source Renaming the directory where Sage is installed is not supported. Instead, use symlinks. For example, install Sage 9.5 |

2022-07-23 15:38:04 +0200 | answered a question | SageMath unable to launch on Windows WSL Some distributions package the SageMath Jupyter kernel separately. For example, Debian has sagemath and sagemath-jupyte |

2022-07-23 15:35:23 +0200 | edited answer | Mittag-Leffler There does not seem to be an implementation in Sage. There is an implementation in R in the MittagLeffleR R package. |

2022-07-22 20:26:42 +0200 | answered a question | Mittag-Leffler There does not seem to be an implementation in Sage. There is an implementation in R in the MittagLeffleR R package. I |

2022-07-20 18:48:22 +0200 | commented question | Simplifying group presentations with the same generators Ideally, edit your question to include the example. Use a blank line before and after the code block, and indent it by |

2022-07-20 12:10:14 +0200 | commented question | Partitioning a (1,-1)square matrix into (0,-1,1)summand matrices Question refined at Ask Sage question 63305. |

2022-07-20 12:06:42 +0200 | commented question | Writing a matrix as a sum of matrices Previously asked as Ask Sage question 60560. |

2022-07-20 12:05:49 +0200 | commented question | Writing a matrix as a sum of matrices Previously asked as Ask Sage question 60560](https://ask.sagemath.org/question/60560/). |

2022-07-20 01:24:40 +0200 | edited question | Writing a matrix as a sum of matrices Given a matrix M=matrix(ZZ, [[1, 1, 1, 1], [1, -1, 1, -1], [1, 1, -1, -1], [1, -1, -1, 1]]), write M= A1+A2+A3+A4+A5+A6 |

2022-07-20 01:24:10 +0200 | edited question | Writing a matrix as a sum of matrices Given a matrix M=matrix(ZZ, [[1, 1, 1, 1], [1, -1, 1, -1], [1, 1, -1, -1], [1, -1, -1, 1]]), write M= A1+A2+A3+A4+A5+A6 |

2022-07-20 01:24:07 +0200 | edited question | Writing a matrix as a sum of matrices Given a matrix M=matrix(ZZ, [[1, 1, 1, 1], [1, -1, 1, -1], [1, 1, -1, -1], [1, -1, -1, 1]]), write M= A1+A2+A3+A4+A5+A6 |

2022-07-18 15:13:18 +0200 | answered a question | Sagemath Ova download The Sage "ova" has been discontinued. See the SageMath installation guide for alternative ways to install Sage. |

2022-07-16 18:12:18 +0200 | commented question | Simplifying group presentations with the same generators Can you provide code for a toy example? |

2022-07-14 13:05:40 +0200 | commented question | Installing an optional huge database package on Arch Linux Congratulations on creating a package and pushing it to the AUR! |

2022-07-09 06:25:59 +0200 | edited question | Checking if dual of matroid is graphic fails Checking if dual of matroid is graphic fails I want to check whether the dual of a matroid is graphic. Example: G1 = G |

2022-07-09 06:23:19 +0200 | edited question | Checking if dual of matroid is graphic fails Checking if dual of matroid is graphic fails I want to check whether the dual of a matroid is graphic. Here's a MWE: G |

2022-07-07 18:18:55 +0200 | commented question | How do you pickle a symbol with a quotient in the subscript? Note: also asked on sage-devel: sage-devel, 2022-07, latex function and operations with fraction subscripts |

2022-07-07 17:57:02 +0200 | edited answer | r.xyz isn't working anymore? (R Project) When Sage starts, r is predefined as the R interpreter. (Edit: this does not seem to be the case in CoCalc.) In a new |

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.