t;specific" to multivariate polynomial rings over
a field. The code for modules, on the over hand, is very generic. Submodules
are only allowed when the base ring is a PID (or a field).
I have also been hit by the lack of this feature. It certainly seems like
something someone should work
irculant[[42, 20, 13]]) returns the circulant matrix with
> first line [42, 20, 13]. Circulant matrix is so "classic" that I'm surprised
> not to find it in Sage.
So am I. However, it's in the pipeline
(http://trac.sagemath.org/sage_trac/ticket/13703)
---
can "cast " f into QM :
sage: QM(f).monomials()
[X^2*Y, X*Y^2, 1]
sage: QM(f).coefficients()
[a + b + 1, 2*b, a*b + a]
---
Charles Bouillaguet
http://www.lifl.fr/~bouillaguet/
>
> This is clearly a*b*X^2*Z + X*Y^2. However, I cannot automatically
Hi,
If you have a polynomial f = x1*x2+x3+x4, then isn't f.subs( {x4 :
blablabla] ) what you are looking for ?
Charles
2013/2/16 Santanu Sarkar :
> Dear all,
> I have the following problem.
>
>
> I am working with Boolean variables. So I call the following.
>
> from sage.crypto.boolean_functio
On Jan 30, 2013, at 3:20 PM, Santanu Sarkar wrote:
>
> N=8
> R.=Integers(N)[]
> f=x^2-1
> print f.roots()
Try :
sage: print f.roots(multiplicities=False)
[1, 3, 5, 7]
It's a start...
---
Charles Bouillaguet
http://www.lifl.fr/~bouillaguet/
--
You received this mes
> 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?
How large is your system ? (how many variables ?). What is the largest degree
in an equation ? Depending on the answer to these
/13268
If you're feeling adventurous, you can apply the patches to your own SAGE
installation, rebuild, and enjoy :)
--
Charles Bouillaguet
Le jeudi 30 juillet 2009 09:05:32 UTC+2, Martin Rubey a écrit :
> William asked me to forward his reply...
>
> (One remark: William always devel
