Ask Your Question

# Neda's profile - activity

 2020-12-02 01:38:41 +0200 received badge ● Popular Question (source) 2020-08-25 00:08:10 +0200 received badge ● Popular Question (source) 2020-04-27 00:35:55 +0200 received badge ● Popular Question (source) 2020-04-27 00:35:55 +0200 received badge ● Notable Question (source) 2020-01-15 00:19:26 +0200 received badge ● Famous Question (source) 2019-08-08 02:19:03 +0200 received badge ● Popular Question (source) 2018-11-18 18:48:50 +0200 received badge ● Popular Question (source) 2018-06-19 17:11:07 +0200 received badge ● Notable Question (source) 2018-04-11 14:39:04 +0200 received badge ● Famous Question (source) 2017-06-25 12:42:19 +0200 received badge ● Popular Question (source) 2017-06-25 12:42:19 +0200 received badge ● Notable Question (source) 2017-02-28 20:05:57 +0200 received badge ● Famous Question (source) 2017-01-22 12:03:56 +0200 received badge ● Notable Question (source) 2016-10-31 05:38:23 +0200 received badge ● Popular Question (source) 2016-05-31 12:48:43 +0200 received badge ● Popular Question (source) 2016-03-03 10:27:33 +0200 received badge ● Popular Question (source) 2016-03-03 10:27:33 +0200 received badge ● Notable Question (source) 2015-08-07 12:03:10 +0200 received badge ● Popular Question (source) 2015-01-19 11:17:51 +0200 received badge ● Famous Question (source) 2014-06-29 18:55:39 +0200 received badge ● Notable Question (source) 2014-06-29 18:55:39 +0200 received badge ● Popular Question (source) 2014-06-29 18:24:58 +0200 received badge ● Notable Question (source) 2014-06-29 18:24:58 +0200 received badge ● Popular Question (source) 2014-06-29 03:15:42 +0200 marked best answer How can I compute Intersect of Ideals? hello Could you please tell me how can I compute intersect of two or more Ideals? Thank you 2014-06-29 03:15:37 +0200 marked best answer How to write trgonometric parametrization? Hello, Could you please tell me how can I solve a trigonometric parametrization, for example using a trigonometric identity to show that x= cos(t) y= cos(2t) parametrizes a portion of a parabola so indicate what portion of the parabola is coverd.. thank you 2014-06-29 03:15:36 +0200 marked best answer Sketch affine variety in R^3 Hello I want to sketch this affine variety in $R^3$: $V((x-2)(x^2-1) , y(x^2-y),(z+1)(x^2-1))$. Is this command implicit_plot3d((x-2)(x^2-1) , y(x^2-y),(z+1)(x^2-1),[-2,2],[-2,2],[-2,2])  correct ? or I should try writing that command 3 times for each part? 2014-06-29 03:15:36 +0200 marked best answer how to write Division command? Hello could you please tell me how can I compute the remainder on division of the given polynomial f by the order set F using grlex order in sage? thank you f= x*y^2+x^3*y^2-y+1 F=(x*y^2-x , x-y^3)  2014-06-29 03:15:36 +0200 marked best answer Euclidean algorithm Hi, I wrote these commands in sage to have Euclidean algorithm but I only get an error.. what is the problem of this algorithm? r=a%b print (a,b,r) while r != 0: a=b; b=r r=a%b print (a,b,r)  by the way how can I create a file named euclid.sage and save the above command in it? 2014-06-29 03:15:36 +0200 marked best answer affine variety Hi! Do you know in a given polynomial with a term order like grevlex, how can I distinct $y>z>x$ insted of $x>y>z$ in sage? 2014-04-07 23:14:13 +0200 received badge ● Notable Question (source) 2013-12-12 09:27:14 +0200 received badge ● Popular Question (source) 2013-06-17 11:31:16 +0200 commented question How to write twisted cubic in sage? should I introduce affine space then use v.rational_points( bound=..) ? 2013-06-17 09:12:12 +0200 asked a question How to write twisted cubic in sage? Hello could you please tell me how can I write twisted cubic ( {cost,sint | t in R}= v(x^2+y^2-1) ) in sage? should I use subscheme command and introduce it as an affine variety? 2013-06-15 05:20:58 +0200 marked best answer How to import some commands? It means that you just have to copy the given line: from sage.rings.polynomial.toy_buchberger import spol  in the Sage command line or in the notebook, and then the spol() function becomes available for the rest of your computation. The fact that not everything is imported by default to save memory and to accelerate startup. If you get an error after typing such a line, then there is a problem with your Sage installation, please report it by giving an example of what you typed, your Sage version, which binary you downloaded, which machine and OS you used. 2013-06-13 22:56:27 +0200 received badge ● Student (source) 2013-06-13 16:42:17 +0200 asked a question How to import some commands? Hello in many question that I asked before the answer was I should import sage: from sage.rings.polynomial.toy_buchberger import spol /.. I want to know how should I import these? I wrote these commands in sage but I've got error, so how should I use these import things? Thank you 2013-06-13 16:28:39 +0200 asked a question why this algorithm does not work? Hello I'm trying to write this algorithm in sage: def roots(f, q): # return list of roots of f in finite field of q elements K. = GF(q) r = [ ] g = qq2zz(f).change_ring(K) for a in K: if g(a) == 0: r.append(a) return r  but i get error, it says that: Traceback (click to the left of this block for traceback ) ....  how should I correct it? 2013-06-12 05:18:48 +0200 marked best answer Euclidean algorithm Hello, First of all, your code works! The problem is that you need to specify a value to the variables a and b. The best way should be to put all that in a function as in the following def euclide(a,b): r=a%b print (a,b,r) while r != 0: a=b; b=r r=a%b print (a,b,r)  Then you can do sage: euclide(12,5) (12, 5, 2) (5, 2, 1) (2, 1, 0)  To use an external file, it depends on how do you use Sage : in a console or with the notebook ? Vincent 2013-06-12 05:13:40 +0200 edited question How to write Buchberger algorithm? Hello, I want to write this algorithm in sage, I know sage is python base but I'm not much familiar with this programming language so I'm working on it.. Could you please tell me how can I write Buchberger algorithm in sage? I know there is commands for computing it, but I want the algorithm.. input= (f1,,fs) output= a groebner basis G={ g1,...,gt} for f ? G initialization : G=F g:= {(fi,fj) | fi,fj ? G , fi!= fj } h:=0 iteration  WHILE *g* != 0 DO choose any {f,g} ? *g* *g*:= *g* \ {{f,g}} h:= (s(f,g)) ^G IF h != 0 THEN *g* := *g* U {{u,h}| u ? G } G:= G U {h}