Re: [sage-support] Re: Lattice reduction over polynomial lattice

Indeed, Sage has row_reduced_form for a polynomial matrix. The row reduced form is sufficient to find a vector in the row space which has minimal degree. The method used to be called weak_popov_form, but that form is slightly stronger and the algorithm does not compute it. Hence the warning.

Re: [sage-support] Re: Create Linear code from vector space

On Thursday, October 6, 2016 at 5:10:55 PM UTC+2, David Joyner wrote: > > On Thu, Oct 6, 2016 at 11:03 AM, Giorgos Marios > wrote: > > I am sorry, i want a large linear code capable of correcting t errors so > i > > can experiment with a simple McEliece implementation

[sage-support] Re: List the codewords of minimum weight

Hi Nathann, There is no significantly faster method than trying all possibilities. Finding the minimum-weight codewords of a linear code is a hard problem. Since your code is not too big, the naive method takes only a few seconds. There are clever algorithms (still exponential) for computing

[sage-support] Re: 6.2 build error: rl_signal_event_hook

That worked, thanks! On Monday, August 4, 2014 3:01:24 PM UTC+2, Volker Braun wrote: Delete the readline libraries that Sage built (local/lib/libreadline*) On Monday, August 4, 2014 1:54:34 PM UTC+1, Johan S. R. Nielsen wrote: Hi everyone, When building Sage 6.2, I'm getting the following

Re: [sage-support] What to use for %display typeset [Was: emacs' sage_mode no longer typesets in 6.2 (Linux)]

Hmm, it seems that the ipython_extension.py should be patched to know about typeset. Directly setting the flag in IPython seems to do the trick: get_ipython().display_formatter.formatters['text/plain'].set_display( typeset) Regards, Johan On Tuesday, May 20, 2014 7:07:35 AM UTC+2, Ivan Andrus

[sage-support] 6.2 build error: rl_signal_event_hook

to having shells which fundamentally relies on readline 6.3, while only 6.2 is shipped with Sage. Jorge Scandaliaris from the aforementioned bug report used Bash 4.3, while I am using Zsh 5.0.5. Any workarounds short of downgrading the shell? Regards, Johan S. R. Nielsen -- You received

[sage-support] sage-mode in Emacs: tab-completion not always working

Hi, Let's see if Ivan or someone else knowledgeable on sage-mode reads here; better to have the question and answer in public, I thought, than to write the developer directly. I just started experimenting with sage-mode, and it looks very promising for me. I haven't used python-mode before,

[sage-support] Re: sage-mode in Emacs: tab-completion not always working

Ok, I feel kind of silly now, becasue I can't seem to reproduce the above myself :-S Something wasn't working so I got the above behaviour, and I had already tried restarting emacs etc., but now everything seems to work perfectly... On Sunday, June 16, 2013 3:58:01 PM UTC+2, Johan S. R. Nielsen

[sage-support] Re: equality between algebraic numbers crashes

On Apr 5, 1:04 pm, Timo theve...@gmail.com wrote: Hello, I get an error message when trying to compare some algebraic numbers. Here is the simplest example I could get: {{{ #!python sage: M = matrix(3, [0,0,1,1,0,1,0,1,0]) sage: x = vector([0,0,1]) sage: y =

[sage-support] Decomposing polynomials from other polynomials using Gröbner bases

Hi Let's say that I have a multivariate polynomial ring R which contains the polynomials p, f1, ..., fn. I also know that p is in the ideal J = f1,..., fn. Now I wish to write p as a polynomial in the f- polynomials. How can I do that with Sage? I can get some of the way by constructing J and

[sage-support] Re: Decomposing polynomials from other polynomials using Gröbner bases

On Apr 5, 1:42 pm, Mike Hansen mhan...@gmail.com wrote: On Tue, Apr 5, 2011 at 1:24 PM, Johan S. R. Nielsen santaph...@gmail.com wrote: Let's say that I have a multivariate polynomial ring R which contains the polynomials p, f1, ..., fn. I also know that p is in the ideal J = f1,..., fn

[sage-support] Re: Decomposing polynomials from other polynomials using Gröbner bases

be linear in the resulting expression for g. Cheers, Johan On Apr 5, 2:08 pm, Johan S. R. Nielsen santaph...@gmail.com wrote: Thanks for the swift reply! That is a neat function, but I don't think it is what I need. I was being too unclear, so here is an example: Let R = Q[x], f1 = x^2 + 1 and f2

[sage-support] Re: Decomposing polynomials from other polynomials using Gröbner bases

This is really cool and seems to be exactly what I need. Thank you very much! Cheers, Johan On Apr 5, 3:19 pm, luisfe lftab...@yahoo.es wrote: On Apr 5, 2:10 pm, Johan S. R. Nielsen santaph...@gmail.com wrote: Oops, continuing: more precisely, we wish to find a q in Q[Y1, Y2] such that q