[sage-devel] Implementation for representation of 2-knots

First of all, I apologize if this isn't the right place to ask this. I spent ages looking for links on the sage website, and this seemed like the most relevant. I spent this summer doing an undergraduate research project on 2-knots, based primarily off of the work from https://arxiv.org/abs/150

Re: [sage-devel] printing polynomials with matrix coefficients

On Mon, 2021-08-02 at 05:14 -0700, 'Martin R' via sage-devel wrote: > is currently rather awkward: > > > sage: M = MatrixSpace(QQ, 2) > sage: L. = PolynomialRing(M) > sage: 1-x > ([-1 0] > [ 0 -1])*x + [1 0] > [0 1] > > Is there a cure? > This also happens with CombinatorialFreeModule, where

[sage-devel] Re: printing polynomials with matrix coefficients

You could increase the rank of the matrix space? sage: M = MatrixSpace(QQ, 20) sage: L. = PolynomialRing(M) sage: 1-x prints a lot nicer. It illustrates that printing matrices, let alone printing polynomials with matrix coefficients, very quickly becomes problematic. For simply cases, you coul

[sage-devel] Re: A ticket that may need special attention :

That one can write a program that uses arbitrarily large amounts of memory is totally expected. In python, one can do: L=[0] while True: L.extend(L) it's really the responsibility of the operating system to decide if the relevant user should have the privilege to grind the system to a halt

[sage-devel] A ticket that may need special attention :

This ticket , result from this ask.sagemath question , may be worth some special attention : it shows a way for Sage to grab all available memory, and possibly

[sage-devel] printing polynomials with matrix coefficients

is currently rather awkward: sage: M = MatrixSpace(QQ, 2) sage: L. = PolynomialRing(M) sage: 1-x ([-1 0] [ 0 -1])*x + [1 0] [0 1] Is there a cure? -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receivin