I take it you mean polynomial equations:
sage: AA. = AffineSpace(GF(2),2)
sage: S = AA.subscheme(x^2+y^2)
sage: S.point_set().points()
[(0, 0), (1, 1)]
On Saturday, December 8, 2012 6:14:19 AM UTC, Santanu wrote:
>
> I have a system of non linear equations over GF(2). How to solve
> them in Sa
Or compute a Gröbner basis:
sage: P. = BooleanPolynomialRing()
sage: Ideal(x^2 + y^2).groebner_basis()
[x + y]
sage: Ideal(x^2 + y^2).variety()
[{y: 0, x: 0}, {y: 1, x: 1}]
On Saturday 08 Dec 2012, Volker Braun wrote:
> I take it you mean polynomial equations:
>
> sage: AA. = AffineSpace(
Thank you. But when I try to solve
f1=x1 + x2 + x4 + x10 + x31 + x43 + x56 ,
f2=x2 + x3 + x5 + x11 + x32 +x44 + x57,
it becomes very slow. Is there any faster approach like
F4 algorithm available in Sage?
On 8 December 2012 17:25, Martin Albrecht wrote:
> Or compute a Gröbner basis:
>
> sage:
Hello, is there a way to solve Diophantine equations in Sage? If not a
general method, perhaps at least some special cases.
There is some interest in solving such equations in Maxima -- I am
daydreaming about porting whatever implementation Sage has. Is there a
generally-accepted more-or-less best
Hello.
There is no general method : see this page
http://mathworld.wolfram.com/DiophantineEquation.html
Best regards.
C.
2012/12/8 Robert Dodier
> Hello, is there a way to solve Diophantine equations in Sage? If not a
> general method, perhaps at least some special cases.
>
> There is some
On Saturday, December 8, 2012 11:07:31 AM UTC-6, Santanu wrote:
>
> Thank you. But when I try to solve
> f1=x1 + x2 + x4 + x10 + x31 + x43 + x56 ,
> f2=x2 + x3 + x5 + x11 + x32 +x44 + x57,
>
> it becomes very slow. Is there any faster approach like
> F4 algorithm available in Sage?
>
F4 is not
Solving a linear diophantine equation is an application of the Smith form.
A quadratic diophantine equation can be solved with the Hasse-Minkowski
theorem, though thats is definitely more advanced
(http://en.wikipedia.org/wiki/Hasse%E2%80%93Minkowski_theorem)
If its not one of these cases then
On 2012-12-08, Volker Braun wrote:
> Solving a linear diophantine equation is an application of the Smith form.
>
> A quadratic diophantine equation can be solved with the Hasse-Minkowski
> theorem, though thats is definitely more advanced
Thanks for the info. Are there implementations of thes
We are talking about the Boolean polynomial ring here, right? So an F4 style
algorithm is used by default (subject to some heuristics). To emphasise you'd
have to construct your ring using the BooleanPolynomialRing constructor.
On Saturday 08 Dec 2012, john_perry_usm wrote:
> On Saturday, Decemb
On Dec 8, 2012, at 7:27 PM, Volker Braun wrote:
> Solving a linear diophantine equation is an application of the Smith form.
>
> A quadratic diophantine equation can be solved with the Hasse-Minkowski
> theorem, though thats is definitely more advanced
> (http://en.wikipedia.org/wiki/Hasse%E2%
On Saturday, December 8, 2012 7:03:48 PM UTC, Ivan Andrus wrote:
> Or are number theorists just born knowing this stuff. :-)
>
Beats me, I'm just a physicist dabbling in computer programming ;-)
--
You received this message because you are subscribed to the Google Groups
"sage-support" grou
On Dec 8, 2012 10:27 AM, "Volker Braun" wrote:
>
> Solving a linear diophantine equation is an application of the Smith form.
>
> A quadratic diophantine equation can be solved with the Hasse-Minkowski
theorem, though thats is definitely more advanced (
http://en.wikipedia.org/wiki/Hasse%E2%80%93M
On Sat, Dec 08, 2012 at 05:46:00PM +, Robert Dodier wrote:
> Hello, is there a way to solve Diophantine equations in Sage? If not a
> general method, perhaps at least some special cases.
>
> There is some interest in solving such equations in Maxima -- I am
> daydreaming about porting whatever
On Sat, Dec 08, 2012 at 11:44:19AM +0530, Santanu Sarkar wrote:
> Dear all,
> I have a system of non linear equations over GF(2). How to solve
> them in Sage?
>
If you need to solve large nonlinear systems over GF(2) and don't
insist on using sage I suspect a better choice is to convert
them to
14 matches
Mail list logo
