I have a question about how you deal with deletion policies in Sagemath.
Specifically, I plan to create a repository with many people involved. This
repo MUST have several admins (who can potentially delete the repo). To
protect the repo from arbitrary deletion, I need to know if Github allows
I would like to solve a polynomial system over RR in sage. See the toy
example below
>>> var_names = ['xor_0_7_x0', 'xor_0_7_x12', 'xor_0_7_y0']
>>> nvars = 3
>>> R=PolynomialRing(RealField(53), nvars, var_names, order="degneglex")
>>> a=R.gens()[0]+R.gens()[1]+R.gens()[2]
>>>
w.lncc.br/)
http://juaninf.blogspot.com
-
El lun, 8 feb 2021 a las 15:35, Juan Grados () escribió:
> Thanks you to reply. The paper does not show the equations.
> -
> D.Sc. Juan del Carmen Grados Vásquez
> Labor
inequality (-1, -1, -1, 3, 0, 3, -2) x + 2 >= 0
>>> > An inequality (0, 1, 0, 0, 0, 0, 0) x + 0 >= 0
>>> > An inequality (1, 0, 0, 0, 1, -1, -1) x + 1 >= 0
>>> > An inequality (0, 0, 0, 0, 0, 0, 1) x + 0 >= 0
>>> > An inequality (1,
Nacional de Computação Científica
Tel: +55 21 97633 3228
(http://www.lncc.br/)
http://juaninf.blogspot.com
-
El dom, 7 feb 2021 a las 22:51, Juan Grados () escribió:
> Yes, but according to that paper it will be 65, and not
> An inequality (1, 0, 0, 0, 0, 0, 0) x + 0 >= 0
> > An inequality (0, 0, 0, 0, 1, 0, 0) x + 0 >= 0
> > An inequality (0, 0, 0, 0, 0, 1, 0) x + 0 >= 0
> > An inequality (0, -1, 0, 1, 0, 1, -1) x + 1 >= 0
> > An inequality (-1, 0, 0, 1, 0, 1, -1) x + 1 >=
Dear members,
I am trying to reproduce page 9 of https://eprint.iacr.org/2016/407.pdf but
until now is not possible to find the 65 inequalities that paper says. I am
thinking that maybe this is because the version of SAGE I am using (this is
9). Do you think that there is any chance to obtain 65
way to sum particular_soln + homogeneous_soln in a fast way?
2018-02-25 19:23 GMT-03:00 David Joyner <wdjoy...@gmail.com>:
> On Sun, Feb 25, 2018 at 4:11 PM, Juan Grados <juan...@gmail.com> wrote:
> > How can I improve the time for the next code?. Basically, I want to
&
How can I improve the time for the next code?. Basically, I want to solve a
large undetermined binary linear system and then I need to calculate its
hamming weight.
A = random_matrix(GF(2), 10, 12, density=0.55)
b = random_vector(GF(2), 10)
particular_soln = A.solve_right(b, check=False)
sorry, dimensions 1 x 1
El 23 de febrero de 2018, 5:14, Juan Grados <juan...@gmail.com> escribió:
> How can I solving a undetermined system with dimension 1 x 1000 over
> finite fields (GF(2)) in SAGE
How can I solving a undetermined system with dimension 1 x 1000 over
finite fields (GF(2)) in SAGE in fast way.
--
-
MSc. Juan del Carmen Grados Vásquez
Laboratório Nacional de Computação Científica
Tel: +55 21 97633 3228
Panos,
I had write patterson algorithm here
http://juaninf.blogspot.com.br/2013/04/function-make-div-with-id-mycell-sage.html
.
2017-03-07 9:47 GMT-03:00 Johan S. H. Rosenkilde :
> Hi Panos,
>
> > I finally implement the decoder using lattice basis reduction (using LLL)
>
> I
More specifically, I need transform a partity check matrix into a
systematic form, but I need the transform matrix
2017-06-10 7:06 GMT-03:00 Juan Grados <juan...@gmail.com>:
> I need an implementaton to perfom a Gaussian elimination on a matrix with
> entries in GF(2). This implement
I need an implementaton to perfom a Gaussian elimination on a matrix with
entries in GF(2). This implementation should return a transformation matrix
and the result of the gassual elimination.
2017-06-10 6:51 GMT-03:00 Simon King <simon.k...@uni-jena.de>:
> Hi Juan,
>
> On 2
Thank by I get
ValueError: too many values to unpack
I think because my matrix has entries in GF(2).
2017-06-09 4:01 GMT-03:00 Kwankyu :
> Is this what you want?
>
> sage: m = matrix(2,[1,2,3,4])
> sage: H,U = m.echelon_form(transformation=True)
> sage: H
> [1 0]
> [0 2]
>
I need the Matrix of operations after gaussian elimination in sage. How Can
I get that?
--
-
MSc. Juan del Carmen Grados Vásquez
Laboratório Nacional de Computação Científica
Tel: +55 21 97633 3228
(http://www.lncc.br/)
I need a operator, or function, to found all solutions of a linear system
over the finite field F_2. For example in the next code I have generated a
random linear system of the form Ax=b, where A=[[1,1,1], [0,1,1]] and b =
[0,1], but when I used the operator \ I have only one solution [1,1,0], but
Hello
I am trying to get different random solution for every loop in my code sage
from sage.sat.boolean_polynomials import solve as solve_sat # optional
- cryptominisat
sr = mq.SR(1,1,1,4,gf2=True,polybori=True)
F,s = sr.polynomial_system()
iter = 0
while(iter < 5):
s
Dears,
Is there any fucntion to calculate the Degree of Regularity of Quadratic
Semi-Regular Determined Polynomial Systems in SAGE. (Looking for that, I
found only for overdetermined systems the
method degree_of_semi_regularity())
thanks by your attention
--
Dears members,
I have two question about the package sage.logic.booleval of SAGE.
1.-In the documentation of that package I have found a similar formula of
this "t = ['&', ['|', 'a', 'b'], ['|', 'a', 'c']]". My question is it is
posible to write three literals in each clause?
2.-In that
I have declared the finite Field K and the equation e. How I can
cast the equation e to finite field K.?
K=GF(2)
e = 0==r1405 + 97557948918122409/154603142862411371*r1406 -
26113332388244438/463809428587234113*r1408 +
180996540766820643/154603142862411371*r1409
thanks
--
I want to plot an histogram in SAGE from a list, my_data, but I want to
plot all values of the axis X, in the below example this must be
X=[0,1,2,3] but I get 2,4,6,8,10, Could you help me please?
my_data = [0,1,2,10]
BC=bar_chart(my_data, width=1, color=lightblue, figsize=4)
Dears members,
I have a object PolynomialSequence in ANF.
PF = PolynomialSequence(total_polynomials, cipherSimon.RR)
I need output this PF object in DIMAC format file. Could you help me please?
--
-
MSc. Juan del Carmen
thanks!
2014-08-31 6:26 GMT-03:00 Dima Pasechnik dimp...@gmail.com:
On 2014-08-31, Juan Grados juan...@gmail.com wrote:
Dears members,
I'm trying to use subs method in PolynomialSequence, but when I doing
that
I get the same PolynomialSequence. For example in code below my
polynomial
Dears members,
I'm trying to use subs method in PolynomialSequence, but when I doing that
I get the same PolynomialSequence. For example in code below my polynomial
sequence PS has only one polynomial (P) ... I'm trying to use subs but I
get the same polynomial. Where is wrong?
reset()
from
Dears members,
How I will be able to extract the monomials of univariate polynomial ring
P of type polynomial_zz_pex.Polynomial_ZZ_pEX?
K = GF(2^128,'t')
PR.X = PolynomialRing(K,X)
P = PR.random_element()
--
-
MSc. Juan del
Dears members,
Let be the field
q = 2
K.t = GF(q^n)
and the Polynomial Ring
PR = PolynomialRing(K,X)
Let be a random monomial of PR for example
P = t*X^(q^a).
Is there any method in sage to reduce X degree of polynomial P, such that
equivalent polynomial is t*X^(q^b) where b =
Dear members,
I'm trying to solve the attach formulas but I get FALSE, anyone know what
means that, or Why I get FALSE?
sage: solve_sat(PolynomialSequence(F,RR),n=infinity)
False
thanks
--
-
MSc. Juan del Carmen Grados Vásquez
I'm wrote a method to get the symbolic coefficients of polynomial p \in
GF(2^pp)[X0,...,X_{nvars-1}] translate to GF(2). The method was wrotte
using companion matrix [1] of irreducible polynomial GF(2^pp). For example
for pp = 2. The polynomial p = X0*X1 = (x_00+x_01*t)*(x_10+x_11*t) =
I'm see that substitution is very slow in SAGE for many many. Is there any
way to get best perfomance to substitution?
thanks
2014-08-22 7:42 GMT-03:00 Juan Grados juan...@gmail.com:
I'm wrote a method to get the symbolic coefficients of polynomial p \in
GF(2^pp)[X0,...,X_{nvars-1}] translate
I'm want a method to get the symbolic coefficients of polynomial p \in
GF(2^pp)[X0,...,X_{nvars-1}] translate to GF(2)[t]. For example for pp = 2.
The polynomial p = X0*X1 = (x_00+x_01*t)*(x_10+x_11*t) =
(x_00*x_10+x_01*x_11) + (x_01*x_11+x_01*x_10 + x_00*x_11)*t then the method
get
Dear Emmanuel,
Thank, ... one last question ... How I will be able to extract the
coefficients of t^0,t^1,...,t^(p-1)
2014-08-18 5:49 GMT-03:00 Emmanuel Charpentier
emanuel.charpent...@gmail.com:
If I follow your cpde correctly, you are working on polynoms in X0,..,X3.
What you attempt to
Dears members I need doing substitution of values vars_gf2subs in vars_GF
variables on p polynomial. I'm trying p.subs(vars_GF[i]=vars_gf2subs[i]) bu
tI get error. How I will be able to doing that?
p = 3
k.t = GF(2^p)
nvars = 4
vars_GF = []
vars_gf2 = []
vars_gf2subs = []
l = 0
for i in
Dear members,
I'm installed the cryptominisat solver using: ./sage -i
cryptominisat-2.9.6 in Sage Version 6.2, Release Date: 2014-05-06 on Ubuntu
14.04 LTS but when I trying to execute the command
from sage.sat.solvers.cryptominisat import CryptoMiniSat
I get the error:
Traceback (most recent
Dears members,
I'm trying to understand why the solver not found solution in this code
R.x,y,z,w = BooleanPolynomialRing()
S = PolynomialSequence([x*y+z,x+y])
sol = S.solve(); sol
[]
For me the solution is x=1;y=1 and z=1, or I'm wrong?
thanks
--
Dears members,
I trying to solve the next problem. Let be the chain of subspaces
J1 \subset J2 \subset J3 \subset J4 over the finite field GF(3), where
dim(J1) = 2, dim(J2) = 4, dim(J3) = 6 and dim(J4)=8. I want extract the
basis vector of the subspace J4-J3, J3-J2 and J2-J1. For J4-J3 I get
Dears members,
I want make a pretty_print in the follow code but I get false, and I want
get the pretty expression of
$$x=\left(\begin{array}{rr}
1 2 \\
3 4
\end{array}\right)$$
var('x')
A=matrix([[1,2],[3,4]])
pretty_print(x==A)
How I will be able to fix that?
--
thanks but I get
$$x= \left(\begin{array}{rr}
1 2 \\
3 4
\end{array}\right)
$$\newcommand{\Bold}[1]{\mathbf{#1}}\hbox{x=\left(\begin{array}{rr}
1 2 \\
3 4
\end{array}\right)}
the latex code and not pretty print
2014-04-01 17:59 GMT-03:00 Dominique Laurain dominique.laurai...@orange.fr
Let be s between 1 and l!-1 an integer value then s can expressed uniquely
than:
s = u1*(l-1)! + u2*(l-2)!+ ... ul*0
Is there any function to find the values u1, u2, ..., ul in SAGE or python?
--
-
MSc. Juan del Carmen Grados
0= u_i = l-i
2013/11/13 Juan Grados juan...@gmail.com
Let be s between 1 and l!-1 an integer value then s can expressed uniquely
than:
s = u1*(l-1)! + u2*(l-2)!+ ... ul*0
Is there any function to find the values u1, u2, ..., ul in SAGE or python
mean something like:
R.Xbar = 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 juan...@gmail.com wrote:
Yes, but p(x) is fixed polynomial here my code
Exists in python, any instruction to solve a linear system equations module
n (integer). In mathematica for example If exists
http://mathematica.stackexchange.com/questions/31696/solving-a-system-of-linear-equations-modulo-n
.
thanks
--
)
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 If exists
http://mathematica.**stackexchange.com/questions/**
31696/solving-a-system-of-**linear-equations-modulo-nhttp
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,
(PolynomialModRing(p),A)\vector(PolynomialModRing(p),b)
but PolynomialModRing not exist ...
2013/10/23 John Cremona john.crem...@gmail.com
On 23 October 2013 19:50, Juan Grados juan...@gmail.com wrote:
Is there in sage, any instruction to solve a linear system equations
module p(x) (polynomial over finite
, x^2 + 2*x + 4, 4*x^2 + 2*x + 3, x^2 + 2*x + 4)
On Wed, Oct 23, 2013 at 11:36 AM, Juan Grados juan...@gmail.com wrote:
thanks, and if the system coefficients are polynomials over finite
field? Is
there PolynomialModRing(p(x))?
2013/10/23 P Purkayastha ppu...@gmail.com
Exists
class=compute
script type=text/x-sage
def Hola():
print Hola
/script
/div
div class=compute
script type=text/x-sage
Hola()
/script
/div
2013/4/19 Jason Grout jason-s...@creativetrax.com
On 4/18/13 11:33 PM, Juan Grados wrote:
Dears members,
I like use the SAGE to embed any code (example
():
print Hola
/script
/div
div class=compute
script type=text/x-sage
Hola()
/script
/div
2013/4/19 Jason Grout jason-s...@creativetrax.com
On 4/19/13 12:07 PM, Juan Grados wrote:
Thanks by your reply, I trying, but yet not work.
$(function () {
// Make the div with id 'mycell' a Sage cell
Dear Jason,
I get, the problem is that code $(function () { ... must be before head
tag.
Thanks by your attention
2013/4/19 Juan Grados juan...@gmail.com
I am trying put this in my entry blog the complete code in the blogger
editor is below. The website is
http://juaninf.blogspot.com.br
Dears members,
Now I get other problem
When I trying
div class=compute1
script type=text/x-sage
m = 4;
K_.a = GF(2);
F.a = GF(2^m,modulus=a^4+a+1);#creado el campo donde vivirá el código
I get ValueError: Modulus parameter not understood.
2013/4/19 Juan Grados juan...@gmail.com
Dear Jason
: %time x = A \ b
CPU times: user 1.61 s, sys: 0.06 s, total: 1.67 s
Wall time: 1.67 s
sage: A * x == b
True
On Wed, Apr 17, 2013 at 1:45 PM, Juan Grados juan...@gmail.com wrote:
I have the equation Ax=b where all matrix entries and all entrie of
vector b
are in GF(2). How I will be able
Dears members,
I executed right_kernel() for any matrix H. Why always I get a basis matrix
in this form [I|A] (I:identity)?
--
-
MSc. Juan del Carmen Grados Vásquez
Laboratório Nacional de Computação Científica
Tel: +55 24
matrix in other form?
H: is a parity check matrix.
T: Toepliz
V: Vandermonde
D: Diagonal
2013/4/18 William Stein wst...@gmail.com
On Thu, Apr 18, 2013 at 1:50 PM, Juan Grados juan...@gmail.com wrote:
Dears members,
I executed right_kernel() for any matrix H. Why always I get a basis
Dears members,
I like use the SAGE to embed any code (example below). But I want linked
two cells using
thishttps://github.com/sagemath/sagecell/blob/master/doc/embedding.rst#linked-cells
instruction
but this not work. How I will be able to fix this?.
For example I trying call from compute cell
I have the equation Ax=b where all matrix entries and all entrie of vector
b are in GF(2). How I will be able to solve this linear system equation
over GF(2) in SAGE software?
--
-
MSc. Juan del Carmen Grados Vásquez
Laboratório
Hi Robert, thanks by your response, but i get the same error
AttributeError: 'FractionFieldElement_1poly_field' object has no
attribute 'list'
2012/7/1 Robert Bradshaw rober...@math.washington.edu
Perhaps your looking for something like
sage: R.x = QQ[]
sage: f = 2 * x^2 / (x^3 + 5); f
Dears members,
How I will can get the coefficients list in Fraction Field. When I write
p.lis() i obtained this message:
'FractionFieldElement_1poly_field' object has no attribute 'list'
--
-
MSc. Juan del Carmen Grados
My question is for the support algorithm, for example: Chien,
Berlekamp-Trace ... etc
2012/3/2 Martin Albrecht martinralbre...@googlemail.com
Have you read the documentation? It's massive as I just found out:
sage: F = GF(3)
sage: P.x = F[]
sage: p = P.random_element()
sage: p.roots?
Or
Jason Grout idea is good for me, but I need empiler several plots, i
after use show(plot1+plot2+...). How do this?.
2012/2/24 Dan Drake dr...@kaist.edu
On Fri, 24 Feb 2012 at 01:39AM -0200, Juan Grados wrote:
I need smooth line, (interpolation the points), line(vec) plot line
without
smoth
...@reativetrax.com
On 2/24/12 2:36 PM, Juan Grados wrote:
Jason Grout idea is good for me, but I need empiler several plots, i
after use show(plot1+plot2+...). How do this?.
Exactly like you said. Make each plot:
plot1=plot(spline(pts), (0,5))
...
and then do
show(plot1+plot2
I fix this, thanks by your time
2012/2/24 Juan Grados juan...@gmail.com
Yes in console terminal, when i make this
p1 = plot(spline(pattersonCpb),
(__builtin__.max(pattersonCpb)[0],__builtin__.min(pattersonCpb)[0]))+points(pattersonCpb)
show(p1)
the plot work fine, but when i make this load
I need smooth line, (interpolation the points), line(vec) plot line without
smoth
2012/2/24 D. S. McNeil dsm...@gmail.com
I am a two-tuple vector, vet=[(1,2),(3,4),(5,6),..], i want plot
this data with a line aproximation, (interpolation this points), exist
any parameter in list_plot
thanks
2012/2/19 Oleksandr Kazymyrov vrona.aka.ham...@gmail.com
Dear Juaninf,
You can call rdtsc in SAGE (Accessing C Functions in Separate
Fileshttp://www.sagemath.org/doc/tutorial/programming.html)
or function %time.
Best regards,
Oleksandr
--
To post to this group, send email to
Dear members.
is there a way to know how much is lost, in computing time, using python
instead of C/ansi to program an algorithm?
--
-
Juan del Carmen Grados Vásquez
Laboratório Nacional de Computação Científica
Tel: +55 24
William thanks for your answer, this information where I can read? ... I'm
doing a good job and I would reference it
2012/2/19 William Stein wst...@gmail.com
On Sun, Feb 19, 2012 at 11:24 AM, Juan Grados juan...@gmail.com wrote:
Dear members.
is there a way to know how much is lost
I dont permissions for this in my server
2012/2/14 emil emil.widm...@gmail.com
On Feb 14, 5:21 pm, juaninf juan...@gmail.com wrote:
Hi everybody
Please I want download the SAGE math for fedora-32bits, but i need the
file with extension *.tar not tar.lzmaa, because my tar program
thanks!
2012/2/14 emil emil.widm...@gmail.com
On Feb 14, 6:57 pm, Juan Grados juan...@gmail.com wrote:
I dont permissions for this in my server
Well, if there is no better solution (like asking sysadmin, or
somebody uploads other package ) you could build lzma (or successor xz
sorry, the measure is cycles/byte. sorry again, how obtain this measure in
SAGE?
2012/2/14 David Kirkby david.kir...@onetel.net
On 14 February 2012 03:40, juaninf juan...@gmail.com wrote:
Hi everybody.
Exists any command in SAGE to get the spent cpu-cycles per second in
SAGE?
What do
but when I put this polynomial x^8+x^7+x^4+x^3+x+1 I get ValueError:
finite field modulus must be irreducible but it is not
2011/12/11 achrzesz achrz...@wp.pl
On Dec 12, 12:10 am, juaninf juan...@gmail.com wrote:
Hi everybody
I want choose different minimal polynomial to build a Galois
... thanks, by your attention, I am reading a documentation to Implement
Galois Field in other place, ...
and declare in C this
static unsigned prim_poly[MAX_EXT_DEG + 1] = {◦1 , ◦3 ,
/∗ not used ∗/
◦7 , ◦13 , ◦23 , ◦45 , ◦103 , ◦203 , ◦435 , ◦1041 , ◦2011 , ◦4005 , ◦10123
, ◦20033 , ◦42103 ,
for all, factors ...
2011/11/5 juaninf juan...@gmail.com
Dears.
In this code
F.a = GF(2^(4))
PR = PolynomialRing(F,'X')
M = vector(PR,8)
#get a g1
g1 = (X + 1) * (X + a) * (X + a^3) * (X + a^5) * (X + a^5 + a^4 + a^3
+ a) * (X + a^6 + a^5 + a^4 + a^2) * (X + a^7 + a^2 + a + 1) * (X +
Dear Maarten
sorry
2011/10/16 Maarten Derickx m.derickx.stud...@gmail.com
Dear Juan Grados,
I don't think people have forgotten it, but merely not answering since you
are asking in the wrong place. This is the sage mailinglist not the mpi4py one
and the problems you are experiencing
yes I trying but ...
http://groups.google.com/group/sage-support/browse_thread/thread/b581f46aad988472#
2011/10/12 Robert Bradshaw rober...@math.washington.edu
No. Also note that sagenb.org is on a single computer shared among
tens of thousands of users, so if you want to do something
help me please
2011/10/12 Juan Grados juan...@gmail.com
yes I trying but ...
http://groups.google.com/group/sage-support/browse_thread/thread/b581f46aad988472#
2011/10/12 Robert Bradshaw rober...@math.washington.edu
No. Also note that sagenb.org is on a single computer shared among
thanks
2011/10/10 D. S. McNeil dsm...@gmail.com
I want that legend is in left side, ... how?
Try something like:
p = plot(sin,legend_label=sin)
p.set_legend_options(loc='upper left')
p.show()
After making some plot p, you can type help(p.set_legend_options) to
see more information
please dont forget
2011/10/5 Juan Grados juan...@gmail.com
I maked this thread
http://groups.google.com/group/mpi4py/browse_thread/thread/2e08c06f271c3069
now I get this error
ImportError:
/home/juaninf/Escritorio/juaninf/Programas/sage/local/lib/python2.6/site-packages/mpi4py/MPI.so
thanks, fix my problem
2011/10/9 Maarten Derickx m.derickx.stud...@gmail.com
In sage the types are not that important (it is just an implementation
detail), but the parent of an object is since that says what the
mathematical meaning of an object is. Try:
q=p.parent()(q)
--
To post to
I maked this thread
http://groups.google.com/group/mpi4py/browse_thread/thread/2e08c06f271c3069
now I get this error
ImportError:
/home/juaninf/Escritorio/juaninf/Programas/sage/local/lib/python2.6/site-packages/mpi4py/MPI.so:
undefined symbol: _PyByteArray_empty_string
2011/10/3 Juan Grados
thanks, Jason, John, I've already done with your help
2011/10/4 Jason Grout jason-s...@creativetrax.com
On 10/4/11 5:28 PM, juaninf wrote:
Hi everyone
I am have 4 vectors, and I want plot 2 graphics in the same place,
vector1 vs vector2 color = red
vector3 vs vector4 color = yelow
You
...
2011/10/2 Juan Grados juan...@gmail.com
My openmpi
openmpi 1.4.1-3
2011/10/2 Volker Braun vbraun.n...@gmail.com
On Sunday, October 2, 2011 4:25:54 PM UTC+2, juaninf wrote:
My MPI version is 0.6,
I guess thats not OpenMPI, then?
--
To post to this group, send email to sage
My MPI version is 0.6,
Ubuntu version Ubuntu 11.04
Sage version 4.7.1
2011/10/2 Volker Braun vbraun.n...@gmail.com
I'd guess lt_dlexit is a symbol that libtool defines that has something to
do with getting out of a dynamic library. Seems like the mpi4py package
misses some linker flags. You
My openmpi
openmpi 1.4.1-3
2011/10/2 Volker Braun vbraun.n...@gmail.com
On Sunday, October 2, 2011 4:25:54 PM UTC+2, juaninf wrote:
My MPI version is 0.6,
I guess thats not OpenMPI, then?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this
fixed
2011/9/30 juaninf juan...@gmail.com
Hi everybody,
I want implement a modified extend Euclidean Algorithm, (egcd
function), but this give wrong results, below my egcd, please help me
to fix ...
def egcd(p1,p2):
if p2 == PR(0):
return (p1,1,0)
else:
(q1, r1) =
Hi David,
Yes already, but I want build other new, because I need make modification
in EEA (add other stop parade), but I first that my EEA Algorithm work
fine ...
thanks
2011/9/30 David Joyner wdjoy...@gmail.com
On Fri, Sep 30, 2011 at 5:11 AM, juaninf juan...@gmail.com wrote:
Hi
I found this method in polynomial_element.pyx file
thanks
2011/9/30 Juan Grados juan...@gmail.com
Hi David,
Yes already, but I want build other new, because I need make modification
in EEA (add other stop parade), but I first that my EEA Algorithm work
fine ...
thanks
2011/9/30
Hi
How I will get a primite element ...
F = GF(2)
PRF.z = PolynomialRing(F);
print PRF
Phi = PRF.quotient(z^4+z+1);
Phi.primitive_element() . ?
--
-
Juan del Carmen Grados Vásquez
Laboratório Nacional de
Hi thanks for your answers,
I used _inverter_, _mul_, _add_ etc, because apparently
the implementation work fine but only apparently,
i think that the essencial problem is with _invert_ method,
but now I used inverse_mod , but I dont
where are the error, I implemented Berlekamp Algorithm too,
in the end line
print sigma.roots(),
always give empty vector, here sigma.roots() should nonzero vector
2011/9/28 Juan Grados juan...@gmail.com
Hi thanks for your answers,
I used _inverter_, _mul_, _add_ etc, because apparently
the implementation work fine but only apparently,
i think
help please!
2011/9/28 Juan Grados juan...@gmail.com
in the end line
print sigma.roots(),
always give empty vector, here sigma.roots() should nonzero vector
2011/9/28 Juan Grados juan...@gmail.com
Hi thanks for your answers,
I used _inverter_, _mul_, _add_ etc, because apparently
Hi David,
Yes I understand, but now I think that have a logic problem in algorithm,
but I don't know where ... i copying lines from [Ict2011], ...
2011/9/28 David Joyner wdjoy...@gmail.com
On Wed, Sep 28, 2011 at 5:58 PM, Juan Grados juan...@gmail.com wrote:
help please!
They did seem
I have already sent, but I dont answer ... because I expect please only if
anyelse can help me iff a time ...
2011/9/28 David Joyner wdjoy...@gmail.com
On Wed, Sep 28, 2011 at 6:12 PM, Juan Grados juan...@gmail.com wrote:
Hi David,
Yes I understand, but now I think that have a logic
91 matches
Mail list logo