On 21 January 2024 12:25:23 GMT, Juan Grados wrote:
>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
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
Dear Sage developers,
I'm trying to install the cysignals 1.11.2 package in Python 3.9.7 using
pip (on a computer with macOS system and Apple M2 chip) and have already
installed the prerequisite packages Cython and Sphinx, but still failed
with some Cython compiling errors (please see the
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]
>>>
Le mercredi 16 septembre 2020 à 23:39:33 UTC+2, rachel...@gmail.com a
écrit :
> I dont know how to code in python
>
That may be the point of the exercise, don't you think ?
HTH,
On Wednesday, September 16, 2020 at 5:27:01 PM UTC-4 dim...@gmail.com wrote:
>
>> On Wed, Sep 16, 2020 at 10:24
I dont know how to code in python
On Wednesday, September 16, 2020 at 5:27:01 PM UTC-4 dim...@gmail.com wrote:
> On Wed, Sep 16, 2020 at 10:24 PM Rachel King wrote:
> >
> > The textbook for a course I am taking says the following,
> > Suppose you have three tests in your linear algebra class
On Wed, Sep 16, 2020 at 10:24 PM Rachel King wrote:
>
> The textbook for a course I am taking says the following,
> Suppose you have three tests in your linear algebra class and your scores are
> 90, 100, and 98. In the Sage cell below, add your scores together and call
> the result total. On
The textbook for a course I am taking says the following,
Suppose you have three tests in your linear algebra class and your scores
are 90, 100, and 98. In the Sage cell below, add your scores together and
call the result total. On the next line, find the average of your test
scores and print
This puzzles me: evaluating '\i' in Python 3 just gives '\i'. Same with
IPython. Evaluating it in Sage prints many warning messages: the following
is from a fresh Sage session, and I only evaluated '\i' once, despite the
appearance:
% sage
Today, I have tried to upgrade from 7.4 to 7.5 (git pull; make ...)
I have a problem with the optional package coxeter3 (it does not compile).
Before trying to solve this problem with coxeter, I would like to know
if there is a canonical way to remove coxeter3 from sage tree to finish
the build
On 9 November 2016 at 00:25, francisco wrote:
> Hello,
>
> I have been computing modular symbols for distinct curves on the Cremona
> data base.
> But, in a few curves, I recived a WARNING messages like this:
>
> Warning : Could not normalize the modular symbols, maybe all
Hello,
I have been computing modular symbols for distinct curves on the Cremona
data base.
But, in a few curves, I recived a WARNING messages like this:
Warning : Could not normalize the modular symbols, maybe all further
results will be multiplied by -1, 2 or -2.
Why sage does not give the
Hello,
I think there might be a bug in how write_lp handles the objective
function. Consider the following simple ILP formulation for signed
domination
===
def signed(G):
I = MixedIntegerLinearProgram(maximization=false)
x = I.new_variable(binary=True)
for u in G:
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
--
On Aug 9, 2015, at 13:31 , Juan Grados wrote:
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 +
Hi everyone,
I'm doing this:
sage: FreeA.a,b,c,d,e,f = FreeAlgebra(QQ,implementation=letterplace)
sage: P = a*b*a*c*c*b + a*b*a*d*d*b + a*c*a*d*d*c + b*c*b*d*d*c
sage: X = P.lm()
sage: X
a*b*a*c*c*b
And now I would like a way to cut my element X into two factors of a
given size. Something like
Hello everyone,
I'm facing an error with the question mark after any kind of function. Here
is an error log with 'PolynomialRing' :
https://gist.github.com/anonymous/f9adbc3ec08dac0892a6
I cannot access the documentation with '?' but it works with :
sage: help(PolynomialRing)
I'm running
Hi Juan,
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?
The thing is that
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,
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
It means that the system is believed to be unsolvable.
On Wednesday 27 Aug 2014 13:54:47 Juan Grados wrote:
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
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
--
This is a bug. In particular:
sage: S.solve(eliminate_linear_variables=False)
[{w: 0, z: 0, y: 0, x: 0}]
Does the trick. The bug is that eliminating linear variables already solves
the problem and the logic in solve() doesn't handle this case. Please open a
ticket and CC me.
On Tuesday 12 Aug
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
I install sage in ubuntu using the following commands:
$apt-add-repository -y ppa:aims/sagemath
$apt-get update
$apt-get install sagemath-upstream-binary
I run sage and gave
sage: hg_sage.status()
NameError Traceback (most recent call last)
Hi Ketch,
What version of Sage have you installed? I ask because Sage has since v6.0
moved to using GIT for version control...
--Kannappan.
On Mon, May 12, 2014 at 1:12 AM, J.A. Ketch jketch12...@gmail.com wrote:
I install sage in ubuntu using the following commands:
$apt-add-repository -y
On Monday, May 12, 2014 6:48:24 AM UTC-4, KnS wrote:
Hi Ketch,
What version of Sage have you installed? I ask because Sage has since v6.0
moved to using GIT for version control...
--Kannappan.
And more importantly, where did you find documentation still using hg? That
will work fine
thank you all for the answers
the version of my sage is : Sage Version 6.1.1, Release Date: 2014-02-04,
so I can not use hg. Some sites for the development refers to hg and not to
git. For instance
http://combinat.sagemath.org/doc/thematic_tutorials/tutorial-how-to-contribute.html,
but is old.
Is anyone there?
I am trying to get sage to understand latex input. I get an error saying that
pdflatex is not installed. How do I do this on a Mac? I have texlive and
texshop installed.
-Walter Wilcox
--
You received this message because you are subscribed to the Google Groups
On Mon, Mar 24, 2014 at 10:05 AM, Wilcox, Walter
walter_wil...@baylor.edu wrote:
Is anyone there?
I am trying to get sage to understand latex input. I get an error saying
that pdflatex is not installed. How do I do this on a Mac? I have texlive
and texshop installed.
I'm not sure what you
On Tue, May 28, 2013 at 10:46 AM, Thierry Dumont
tdum...@math.univ-lyon1.fr wrote:
Hi,
I am experimenting with fast Fourier Transform in Sage.
It seems there are different possibilities.
1) There is: FastFourierTransform
FastFourierTransform(size, base_ring=None)
2) One can simply do:
v =
Suppose I want to generate partitions that are in an arithmetic progression
with a particular step size...seems straightforward enough, so I just set
max_slope and min_slope to that step size. Is this interpretation correct?
Ps=Partitions(11,max_slope=-1, min_slope=-1)
print Ps.cardinality()
Dears members,
I want know if SAGE, used with mpi4py, support distribuited programming i.e
distruited memory for example ...
atte
Juan
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To post to this group, send email to
Any one knows if *
sage-5.1-linux-64bit-ubuntu_8.04.4_lts-x86_64-Linux.tar.gz*http://sagemath.c3sl.ufpr.br/linux/64bit/sage-5.1-linux-64bit-ubuntu_8.04.4_lts-x86_64-Linux.tar.gz
precompiled binaries needs the libc6 version 2.14 to run?
I'm using Debian Testing and the (latest) version avaible
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
Hi Everybody,
I want sort in lexicographic order a binary strings (numpy array), I can
use sorted function?
best regards
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more
Dears members.
Give F.a = GF(2^self.m,modulus=a^4+a+1); and let p(X), g(X) belong
F[X], I want know, if is there any function to obtain the xgcd of p(X)
and g(X), but when these are in log representation?
thanks
--
To post to this group, send email to sage-support@googlegroups.com
To
Dears members
I need axes_labels in vertical and horizontal form in side sideways od
axis, how make this?. example
http://www.personal.psu.edu/egp11/Eric_Paterson/Blog/Entries/2009/11/18_Open-Source_alternatives_for_MATLAB_in_teaching_and_research_files/ericPlot.jpg
#P is list_plot tipe
Dears members
I am have a p(X) belong F[X], where F is a Galois Field. In sage i
have a roots() function, I want know please, What is a algorithm used
for implement this function?.
thanks.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group,
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 check the source:
sage: p.roots??
On Saturday 03 Mar 2012, juaninf wrote:
Dears members
I am have a p(X) belong F[X], where F is a Galois Field.
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
When I run:
sage: q = QuadraticForm(ZZ,2,[3,2,5])
sage: q.polynomial()
6*x0^2 + 4*x0*x1 + 10*x1^2
I would expect to get half of this result, which is the quadratic form
as a polynomial. The doc tests say this is what the behavior should
be, but I don't understand why. Is this actually the
On Feb 24, 2012, at 08:04 , Jacob Hicks wrote:
When I run:
sage: q = QuadraticForm(ZZ,2,[3,2,5])
sage: q.polynomial()
6*x0^2 + 4*x0*x1 + 10*x1^2
I would expect to get half of this result, which is the quadratic form
as a polynomial. The doc tests say this is what the behavior should
Justin,
I don't think that is the issue here: you are referring to the debate
between using a,2*b,c as coefficeints rather than a,b,c. But here
*all* the coefficients have been doubled.
Note that we also have
sage: BinaryQF([1,2,3])
x^2 + 2*x*y + 3*y^2
john
On 24 February 2012 16:04, Jacob
On Feb 24, 2012, at 09:49 , John Cremona wrote:
I don't think that is the issue here: you are referring to the debate
between using a,2*b,c as coefficeints rather than a,b,c. But here
*all* the coefficients have been doubled.
I haven't looked at this code in detail yet, but I'm pretty sure
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
Dear members
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 function for this.
Juan
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from
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 function for this.
Maybe
line(vet)
does what you want? You can look at
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
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
If a regression line is good enough, see:
http://markmail.org/message/lipt7edldscsaaqb (another one of Jason's
messages!)
Dan
--
--- Dan Drake
-
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
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, in computing time, using python
instead of C/ansi to program an algorithm?
It depends entirely on the algorithm and what that algorithm uses from
Python/Sage.
The
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, in
Dear members
Exist any function in SAGE with same goal of rdtsc() in C?.
For example:
tmp_ini = rdtsc()
...
instructions ..
...
tmp_dec = rdtsc() - tmp_ini;
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
On Wednesday, February 15, 2012 7:12:20 AM UTC+1, juaninf wrote:
sorry, the measure is cycles/byte. sorry again, how obtain this measure in
SAGE?
I am a bit confused, what is cycles/byte? It would really help if you
could expand this to a full example and explain us in detail what you
Here is a small example that illustrates my question:
http://pastebin.com/GmPhFmT6
Why doesn't this print True?
I believe the answer has something to do with the version of sage. If
you access G1._factory_data or G2._factory_data you get:
(class '__main__.UniqueGraphFactory', (4, 8), (2, (1,
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 you mean by spent cycles per second? Time must be measured in
seconds, not inverse seconds, so I assume you don't mean time.
I
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 no
have support fot this extension, ...
http://ftp.iitm.ac.in/sage/linux/32bit/index.html.
You know where are url? to download this, (without
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
Hi everybody.
Exists any command in SAGE to get the spent cpu-cycles per second in
SAGE?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
I'm confused by the fact that variables defined inside functions can
leak out and become global variables. Here's what I've noticed.
(1) I create a file called steiner.py for finding the Steiner point
given three points in the plane. Here's my code:
def dist(p,q):
Eulidean distance
Hi everybody
I want choose different minimal polynomial to build a Galois Field
2^m, how?
For example: m = 8
sageF.a=GF(2^8)
sage:print a.minpoly()
I get ...
x^8 + x^4 + x^3 + x^2 + 1
but I want now other polynomial for example
x^8+x^7+x^4+x^3+x+1
How?
thanks
--
To post to this group, send
Dears
I want create a new datatype,
sage.rings.polynomial.polynomial_zz_pex.Polynomial_ZZ_pEX, to use
comm.Reduce method,
comm.Reduce([PROD,sage.rings.polynomial.polynomial_zz_pex.Polynomial_ZZ_pEX],
[RESUL,sage.rings.polynomial.polynomial_zz_pex.Polynomial_ZZ_pEX],op=MPI.SUM,
root=0)
how i can
On Thursday 13 October 2011, juaninf wrote:
I want implement a efficient linear solve system over GF(2) (and too
parallel if this is posible),
Hi, are you talking about sparse or dense systems?
i reading this article, but i dont understand
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
computationally expensive you're better of installing Sage on your own
hardware.
On Tue, Oct 11, 2011 at 8:38 AM, juaninf juan...@gmail.com wrote:
Exist sagenb.org with
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
I want implement a efficient linear solve system over GF(2) (and too
parallel if this is posible), i reading this article, but i dont
understand
http://ask.sagemath.org/question/467/solve-large-system-of-linear-equations-over-gf2
please I like please a example how, make this?
for example with
Exist sagenb.org with openmpi module?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/sage-support
URL:
Hi everyone
I want know if exist a parallel implementation to kernels of matrices
with openmpi
in sage
thanks
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit
Dears
I am having a problem with legend place in plot please see this URL
http://juaninf.blogspot.com/2011/10/pronto-comparacion-de-algoritmos-para.html
I want that legend is in left side, ... how?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this
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 about the various things you can configure.
Doug
--
To
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
Hi everyone
I have two polynomial p,q, when I make
sage:print polynomial, type(polynomial)
get
a*X type 'sage.rings.polynomial.polynomial_zz_pex.Polynomial_ZZ_pEX'
X^4 + (a + 1)*X^3 + (a^3 + a)*X^2 + a*X + 1 class
'sage.rings.fraction_field_element.FractionFieldElement_1poly_field'
I want
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
How?
please help me,
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Hi everyone
I want use eclipse + pydev IDE for SAGE, I see this
https://groups.google.com/forum/#!topic/sage-support/HTPssIMKMHw/discussion
I got set sage-python as interpreter, but when run the *. sage, it
returns Error
File / home/juaninf/workspace/goppa1/src/test.sage, line 28
F. x = GF
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) =
Phi(z) since by in your example the reduction of z will be primitive by
definition.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
How do a(x) congruence b(x)R(x) mod (g(x)) in sage?
thanks by your answers
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
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) = (p1).quo_rem(p2)
(d,s1,t1) = egcd(p2, r1)
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
This is definitely not a bug. The definition of the _add_ method
absolutely demands that both inputs have exactly the same parent. In
the above instance, the left hand input (=1) has parent ZZ, and the
right hand input (=SR(2)) has parent the symbolic ring.
Yeah, I know that-- it's the
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 to
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
Hi everybody,
I am implement Patterson Algorithm for Goppa code,
I am copying lines from paper How SAGE helps to implement Goppa
Codes and McEliece PKCSs [attach], and my test is a random vector .
the error are in Line 77,
I expect get roots from \sigma (locator polynomial), but
implementation
I don't think you should need to call _add_, but this looks like a bug to me:
--
| Sage Version 4.7.1, Release Date: 2011-08-11 |
| Type notebook() for the GUI, and license() for information.|
On Tue, Sep 27, 2011 at 7:15 PM, D. S. McNeil dsm...@gmail.com wrote:
I don't think you should need to call _add_, but this looks like a bug to me:
--
| Sage Version 4.7.1, Release Date: 2011-08-11 |
|
Hum...
[radical(k) for k in [1..30]] produces the expected list however
[radical(k) for k in range(1,31)] rises an error
AttributeError: 'int' object has no attribute 'factor'
Wouldn't it be nice if the 2nd comprehension also give the desire
list? Any reason why shouldn't SAGE take that?
--
Hi,
On Aug 17, 2011, at 00:20 , pong wrote:
[radical(k) for k in [1..30]] produces the expected list however
[radical(k) for k in range(1,31)] rises an error
AttributeError: 'int' object has no attribute 'factor'
The problem here is the distinction between Python 'int's and Sage
Hello, Sage groups, I have a problem, please see the example below, I
wonder anyone can help me solve this problem:
f = Piecewise([[(0,pi/2),-1],[(pi/2,pi),2]])
a=pi*integrate(f,x,0,pi)
a.show()
b=pi*integrate(sin(x),x,0,pi)
b.show()
integrate(f*sin(x),x,0,pi)
Hi list
i need to construct two morphisms
f:ZZ^n \to Z given by a diagonalmatrix
and g: ZZ - Z/dZ
because I have to find the kernel of the compositoin.
consturcting g was no problem by g = ZZ.hom(ZZ.quotient(ZZ.ideal(d)))
father, getting the kernel of f as matrix worked too.
but how to get the
On Tue, Aug 2, 2011 at 12:21 PM, Johannes dajo.m...@web.de wrote:
Hi list
i need to construct two morphisms
f:ZZ^n \to Z given by a diagonalmatrix
and g: ZZ - Z/dZ
because I have to find the kernel of the compositoin.
consturcting g was no problem by g = ZZ.hom(ZZ.quotient(ZZ.ideal(d)))
On Fri, Sep 24, 2010 at 6:56 PM, kcrisman kcris...@gmail.com wrote:
If I make a polynomial ring using
sage: b = PolynomialRing(ZZ, 'x')
I get some odd behavior. Namely,
sage: bool(b(x)==x)
True
sage: b(x)
x
sage: type(b(x))
something about element of the ring
sage: type(x)
symbolic
On Fri, 24 Sep 2010 18:56:14 -0700 (PDT)
kcrisman kcris...@gmail.com wrote:
sage: a = FractionField(PolynomialRing(ZZ, 'x'))
sage: a(1/x)
weird error that seems to imply it has not coerced x to the
polynomial ring
Did I do something wrong, or is this a bug? Because of the initial
If I make a polynomial ring using
sage: b = PolynomialRing(ZZ, 'x')
I get some odd behavior. Namely,
sage: bool(b(x)==x)
True
sage: b(x)
x
sage: type(b(x))
something about element of the ring
sage: type(x)
symbolic expression
This isn't really that odd, but still I don't know whether it is
1 - 100 of 136 matches
Mail list logo