Re: [sage-support] Linear System Equations Polynomials

2013-10-23 Thread Ivan Andrus
Do you mean something like: R. = PR.quotient(PR.ideal(p)) # change your formulas to Xbar instead of X A \ b # ==> (a^3 + a, a^2, (a^3 + a^2)*Xbar^2 + (a + 1)*Xbar + a^3 + a) -Ivan On Oct 23, 2013, at 1:14 PM, Juan Grados wrote: > Yes, but p(x) is fixed polynomial here my code > > m = 4;delta

Re: [sage-support] Re: (unknown)

2013-10-23 Thread Juan Grados
please see my code in the question http://stackoverflow.com/questions/19550649/solve-linear-system-over-finite-field-with-module. is not same structure than your example. thanks 2013/10/23 Robert Bradshaw > sage: Integers(45)['t'] > Univariate Polynomial Ring in t over Ring of integers modulo

Re: [sage-support] Re: (unknown)

2013-10-23 Thread Robert Bradshaw
sage: Integers(45)['t'] Univariate Polynomial Ring in t over Ring of integers modulo 45 I don't think we have linear algebra over general non-integral-domains, but sage: R = GF(5)['x'] sage: M = random_matrix(R, 4, 4); b = random_vector(R, 4); x = M \ b sage: M*x (4*x^2 + x + 4, x^2 + 2*x + 4, 4*

Re: [sage-support] Linear System Equations Polynomials

2013-10-23 Thread Juan Grados
Yes, but p(x) is fixed polynomial here my code m = 4;delta = 3;N = 2^m K_. = GF(2); F. = GF(2^m) PR = PolynomialRing(F,'X') X = PR.gen() a11 = (a^2)*(X^3)+(a^11)*(X^2)+1 a12 = (a)*(X^4)+(a^13)*(X^3)+X+1 a13 = X^2+(a^13)*(X^3)+a*(X^2)+1 a21 = X^3 a22 = X+a a23 = X^2+X^3+a*X a31 = (a^12)*X+a*(X^2) a

Re: [sage-support] Linear System Equations Polynomials

2013-10-23 Thread John Cremona
On 23 October 2013 19:50, Juan Grados wrote: > Is there in sage, any instruction to solve a linear system equations > module p(x) (polynomial over finite field), where the system coefficients > are polynomials over finite field?. I know that for integers exists, example > (thanks Purkayastha) > >

[sage-support] Linear System Equations Polynomials

2013-10-23 Thread Juan Grados
Is there in sage, any instruction to solve a linear system equations module p(x) (polynomial over finite field), where the system coefficients are polynomials over finite field?. I know that for integers exists, example (thanks Purkayastha) sage: I6 = IntegerModRing(6) sage: M = random_matrix(I6,

Re: [sage-support] Re: (unknown)

2013-10-23 Thread Juan Grados
thanks, and if the system coefficients are polynomials over finite field? Is there PolynomialModRing(p(x))? 2013/10/23 P Purkayastha > Exists in Sage: > > sage: I6 = IntegerModRing(6) > sage: M = random_matrix(I6, 4, 4) > sage: v = random_vector(I6, 4) > sage: M \ v > (4, 0, 2, 1) > > > On 10/

[sage-support] Re: (unknown)

2013-10-23 Thread P Purkayastha
Exists in Sage: sage: I6 = IntegerModRing(6) sage: M = random_matrix(I6, 4, 4) sage: v = random_vector(I6, 4) sage: M \ v (4, 0, 2, 1) On 10/23/2013 09:11 PM, Juan Grados wrote: Exists in python, any instruction to solve a linear system equations module n (integer). In mathematica for example

[sage-support]

2013-10-23 Thread Juan Grados
Exists in python, any instruction to solve a linear system equations module n (integer). In mathematica for example If exists . thanks -- -

Re: [sage-support] Failed to start Mathematica 9 in Sage 5.12. How can I fix it?

2013-10-23 Thread Daniel Krenn
Am 2013-10-19 04:41, schrieb meaning: > I have a problem when calling Mathematica 9 in Sage 5.12. > > I installed Mathematica 9, Sage 5.12 and claim their direction in > .bash_profile file. > The direction of Mathematica is: /usr/local/bin/mathematica > The direction of Sage is: ~/wor