2018-12-09 16:51:13 -0600 | asked a question | Free nilpotent Lie algebra of step 3 with 11 generators This works: and this works: but this doesn't work: though it should? Traceback: |

2018-12-06 11:17:59 -0600 | received badge | ● Nice Answer (source) |

2018-12-05 12:42:54 -0600 | answered a question | Understanding Output in SageMath Regarding Dirichlet Characters Armed with some knowledge of the general structure of Sage, you can find it out: |

2018-12-04 10:34:20 -0600 | answered a question | numerical_approx() Sage's and SymPy's expressions and numbers have different types, but you can convert between them as explained in A Sample Session using SymPy. In your case: |

2018-12-04 03:58:55 -0600 | commented question | Sagemanifold - Connection components from a tensor (not a metric) This is not my field so I'm not sure: what generalization do you need exactly? What do you want to do (in code) that you can't? A code sample (e.g. of how you wish it would work) would help. |

2018-12-04 03:05:53 -0600 | received badge | ● Good Answer (source) |

2018-12-04 03:05:19 -0600 | received badge | ● Good Answer (source) |

2018-12-03 15:14:56 -0600 | received badge | ● Nice Answer (source) |

2018-12-03 15:13:30 -0600 | received badge | ● Nice Answer (source) |

2018-12-03 12:33:43 -0600 | commented question | Trying to get the right inverse, not possible I don't know. Maybe try asking the author. |

2018-12-03 12:05:20 -0600 | answered a question | Sagemanifold - `only_nonredundant = True` by default That would be nice to have as an option indeed. As a workaround, you could define something like so you can do |

2018-12-03 11:49:32 -0600 | answered a question | Subtitute functions - in a differential equation - Sagemanifold It works the same way as last time, by using |

2018-12-02 17:39:12 -0600 | commented answer | Error in finding the closest vector in a sublattice of Z^n The algorithm was originally implemented by Jan Pöschko in 2012 based on the paper Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm by Emanuele Viterbo and Ezio Biglieri (1996). I don't have the time for it now, but the way to fix the code can probably be found by reading and understanding these resources. |

2018-12-02 16:46:29 -0600 | commented answer | Error in finding the closest vector in a sublattice of Z^n This time the problem is in the function |

2018-12-02 13:52:42 -0600 | commented answer | Error in finding the closest vector in a sublattice of Z^n In your local installation you can find the code I mentioned in |

2018-12-02 12:39:33 -0600 | answered a question | Error in finding the closest vector in a sublattice of Z^n You're not doing anything wrong; it is Sage that is wrong. Here This code assumes that the result of The solution is to fix this part of Sage's code, e.g. replace the expression by: To get this fix into Sage (for everyone to enjoy) a trac ticket should be opened for this problem and solution. |

2018-11-29 12:07:33 -0600 | commented question | Trying to get the right inverse, not possible If "the paper" is not secret then please share it; it would make it easier to help you. |

2018-11-28 12:35:50 -0600 | commented question | Sagemanifold: autoparallel curve equations Please show what you have done, by sharing the code. Hypothetical code is hard to debug. |

2018-11-25 15:33:47 -0600 | commented answer | Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field Ah yes, I missed that. Nice find. |

2018-11-24 10:39:16 -0600 | commented answer | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? You're welcome :) I added a remark about how it is related to Groebner bases. |

2018-11-24 09:39:54 -0600 | commented answer | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? Every element of the finite field $\mathbb{F}_{2^e}$ can be written (for a fixed modulus) as a polynomial of degree |

2018-11-24 09:20:50 -0600 | answered a question | Finding the Groebner Basis of the following Ring. Is it possible? How could I make it work with multivariate polynomials? I'm not sure what you're trying to do here. Groebner bases make sense for ideals in polynomial rings over a field. Your Or with more variables (when Groebner bases are more interesting): Since the quotient $\mathbb{F}_2[r]/(p)$ is a field $\cong \mathbb{F}_{2^e}$, it is more efficient to construct it as follows: An element By the way, this can be done with a Groebner basis of $(p) \subset \mathbb{F}_2[x]$ as well. Namely, the In this one-variable situation, the normal form is just the remainder after polynomial division. |

2018-11-22 13:55:38 -0600 | commented question | Eigenvectors of matrices over finite fields Please add an example and the error you get. |

2018-11-22 07:26:40 -0600 | answered a question | Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field See Wikipedia - Polynomial extended Euclidean algorithm:
So e.g. at the end you can do |

2018-11-22 03:34:26 -0600 | commented question | Assignation of components of a differential form (or multivector field) in sagemanifold Please add an example of what is tedious. |

2018-11-22 03:11:38 -0600 | commented question | Tensor density in sagemanifolds? I don't think this is implemented yet. To implement tensor densities I guess |

2018-11-20 10:25:10 -0600 | commented question | `Fraction must have unit denominator`when using polynomial.numerator() You should learn to debug a little better, at least to pin down where the error comes from. In this instance e.g. search for division |

2018-11-18 14:53:13 -0600 | commented answer | Computing the basis of the Frobenius function fixed point space Well done. Note that |

2018-11-18 13:29:41 -0600 | commented question | Computing the basis of the Frobenius function fixed point space By trying basic debugging you see the big scary error comes from |

2018-11-18 09:40:25 -0600 | commented question | Computing the basis of the Frobenius function fixed point space Technical hints: |

2018-11-18 07:56:34 -0600 | commented question | Computing the basis of the Frobenius function fixed point space Hint: a basis of $\mathbb{F}_q[x]/(f)$ is $1, x, \ldots, x^{\deg(f)-1}$ and you can write the linear map as a matrix, so you just have to do linear algebra over $\mathbb{F}_q$. For reference, this is part of Berlekamp's algorithm and $W$ is called the Berlekamp subalgebra. |

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.