20231029 16:42:20 +0100  received badge  ● Notable Question (source) 
20231029 16:42:20 +0100  received badge  ● Popular Question (source) 
20180521 22:53:10 +0100  received badge  ● Student (source) 
20180315 13:36:05 +0100  commented question  Factoring out permutations of SN Thank you, (2) is what I was looking for, but I expected it would not return a list and return an iterator instead. (1) and (4) seems the most appropriate. 
20180314 13:52:42 +0100  asked a question  Factoring out permutations of SN I'm trying to remove certain permutations from S_N. I want to remove all permutations that leave the first [0...k[ indices invariant (except for Identity element). So what I'm looking for is S_{1,.., N} / S_{k, .., N}. I understand that I could do ( N= 10, k=5 ) but this is extremely slow. My goal here is to speed up my code and I end up generating twice as much permutations and doing extreme list checking. I'm pretty sure people were smart enough to implement a feature that gives me back a generator Squotient = SN/SkN, but I could not find this in the documentation. Any ideas? 
20180208 14:29:11 +0100  commented answer  Use Vi keys in sage console If you don't have the ipython_config.py file, you can create it with

20180206 14:02:07 +0100  commented answer  How to properly declare indeterminates so that they exist in the coefficient ring. In the end this worked. For future reference, in more general cases I ended up with systems of equations in QQ['alpha, 'a0', 'a1', ...].fraction_field() which produced big expressions that somehow sage was confused about (it tried to expand the fractions as power series instead of factoring and simplifying). Factoring and simplifying did not work since the gcd was not well defined. I ended up sending the system of equation to singular for simplification, then back to sage, converted to symbolic ring, solved, converted the solution back to my ring. It still looks like a crazy workaround to me though, but it does work. 
20180201 16:24:05 +0100  received badge  ● Scholar (source) 
20180201 15:50:58 +0100  received badge  ● Editor (source) 
20180201 15:48:50 +0100  asked a question  How to properly declare indeterminates so that they exist in the coefficient ring. I'm working on a project regarding generalization of symmetric polynomials. For the sake of simplicity, I will ask my question in the context of a minimalistic (not) working example. Let say I am working with Symmetric Functions, I'll write an erroneous code so that you get the idea of what I'm looking for The I get the error
and it works. But the probleme is that I can't convert the solution back
And anyway this last solution does not seem very canonical. How should I proceed?
I guess that somehow what I am asking is how to declare 
20180111 22:20:19 +0100  asked a question  unpacking list in a list Hi, I'm trying to convert a sympy code to sage. I have found that the following does not work: even though the unpacking works for functions (ex F(*sector1)). How do I do that? 