2024-02-11 19:51:39 +0200 | received badge | ● Notable Question (source) |
2024-02-11 19:51:39 +0200 | received badge | ● Popular Question (source) |
2023-03-06 11:55:50 +0200 | marked best answer | problem with constant_coefficient of a form of ExteriorAlgebra Hi,
I have a problem with ExteriorAlgebra and I do not understand where I am wrong. Let's define an ExteriorAlgebra Take for example which gives this gives It worked correctly until time ago, this behaviour only appear now: so probably I'm missing something that changed recently. I'm using SageMath version 9.7 on CoCalc. Thanks in advance! |
2023-03-05 11:03:07 +0200 | commented question | problem with constant_coefficient of a form of ExteriorAlgebra thanks, corrected! |
2023-03-05 11:02:59 +0200 | edited question | problem with constant_coefficient of a form of ExteriorAlgebra problem with constant_coefficient of a form of ExteriorAlgebra Hi, I have a problem with ExteriorAlgebra and I do not un |
2023-03-05 10:22:36 +0200 | asked a question | problem with constant_coefficient of a form of ExteriorAlgebra problem with constant_coefficient of a form of ExteriorAlgebra Hi, I have a problem with ExteriorAlgebra and I do not un |
2021-06-10 21:25:00 +0200 | received badge | ● Notable Question (source) |
2019-10-10 13:19:03 +0200 | received badge | ● Popular Question (source) |
2018-12-03 15:01:48 +0200 | received badge | ● Popular Question (source) |
2017-08-24 19:30:09 +0200 | received badge | ● Critic (source) |
2017-06-04 12:53:48 +0200 | received badge | ● Nice Question (source) |
2017-06-03 00:29:02 +0200 | answered a question | How to decide if T maps R^5 onto R^5 Just compute the rank of the matrix: |
2017-06-02 19:12:44 +0200 | asked a question | a problem with variables in real domains Hi, I have a problem with setting the domains of definition of variables. For example, typing I get the result Where I'm wrong? thanks! |
2017-06-02 11:24:34 +0200 | asked a question | Efficient algorithms for simplification Hi!
I come back on an issue on Sage/Maxima, about simplification.
I have some large rational polynomial expressions in -say- ten variables that I would like to simplify.
|
2016-11-30 13:55:51 +0200 | received badge | ● Popular Question (source) |
2016-11-30 13:55:51 +0200 | received badge | ● Notable Question (source) |
2016-11-30 13:55:51 +0200 | received badge | ● Famous Question (source) |
2016-09-20 08:49:21 +0200 | commented answer | how to kill a variable @paulmasson: thanks, corrected! |
2016-09-20 01:46:15 +0200 | received badge | ● Nice Answer (source) |
2016-09-19 10:31:20 +0200 | answered a question | how to kill a variable |
2016-09-08 19:36:29 +0200 | asked a question | Automorphisms and derivations of Lie algebras Is there a way to compute automorphisms and/or derivations of a Lie algebra (of dimension 4)? Thanks in advance! |
2016-08-13 19:31:35 +0200 | received badge | ● Famous Question (source) |
2016-08-13 19:31:35 +0200 | received badge | ● Notable Question (source) |
2016-04-08 10:39:08 +0200 | received badge | ● Popular Question (source) |
2016-01-22 14:58:03 +0200 | received badge | ● Nice Question (source) |
2016-01-22 14:57:53 +0200 | received badge | ● Nice Question (source) |
2016-01-21 18:42:05 +0200 | commented question | Dimension of a certain subspace of a matrix space I can not edit, still. Here below a translation: Write a function in Sage, with the aim to compute the dimension of the vector subspace $W \subseteq \mathrm{End}(M_n(\mathbb{R}))$ constructed as following: W consists of linear maps $F(A;B) \colon M_n(\mathbb{R}) \to M_n(\mathbb{R})$ such that $F(A;B) \colon X \mapsto AX + XB$ with $A$, $B$ in $M_n(\mathbb{R})$. Here, $n\geq 2$. |
2016-01-13 12:23:22 +0200 | received badge | ● Enthusiast |
2016-01-11 12:29:49 +0200 | asked a question | rank of matrices depending on parameters Hi! I have a question on how to treat objects depending with parameters. For example, let M be a matrix depending on a parameter - call it t. The rank command just returns the generic rank. I would like to know the rank of the matrix, varying the parameter. In the example, I would like to get: if t=0, the rank is 1; otherwise is 2. Is there any command for this in Sage? (I've heard about a "full solve" in Mathematica.) Thanks in advance, |
2016-01-06 22:33:38 +0200 | received badge | ● Good Question (source) |
2016-01-04 18:00:59 +0200 | marked best answer | Substitution of parameters I would like to understand what is the correct and more efficient way for performing sostitution of parameters in objects of some category. For example, a typical problem for me is the following. I have a 1-form in an ExteriorAlgebra, whose coefficients depends on some variable, let's say t. I find conditions on such parameters, let's say, t should be zero in order that some property holds. (In general, i will have solutions of linear systems.) I try to use "substitute" for setting the parameter to be 0, but this does not work to me.. Another solution I tried is the following. I assume t==0 at a certain point. But this seems to me to force the substitution before too. Thanks in advance for any suggestions! |
2016-01-04 17:48:08 +0200 | commented question | assume a variable has two possible values dear Thierry, what kind of assumptions are not taken into account? and what do you mean by "not taken into account"? the problem is related to a reseach problem I'm studying. I should try to write a sample example. Roughly speaking, I have objects in a Lie algebra (whose structure equations may depend on parameters), and I am declaring objects with variable coefficients. Some additional properties add constraints on the possible values of the coefficients. I am using assume() to take into account the several properties. Thanks in advance, all the best, |
2016-01-04 15:23:04 +0200 | received badge | ● Nice Question (source) |
2016-01-04 15:18:08 +0200 | received badge | ● Nice Question (source) |
2016-01-03 14:49:04 +0200 | asked a question | Extract equalities from a list of assumptions Hi, how can I recognize an equality from an inequality, in a list of assumptions? thanks, |
2016-01-02 23:53:00 +0200 | asked a question | assume a variable has two possible values Hi, how can I assume that a variable admits only a finite number of possible values? E.g., the variable x can only be 0 or 1. I could assume that
but I am looking whether there is a straightforward way, too. thanks in advance |