On Tuesday, 22 October 2019 23:23:44 UTC+2, Dima Pasechnik wrote:
>
> On Tue, Oct 22, 2019 at 9:51 PM 'Bill Hart' via sage-devel
> > wrote:
> >
> >
> >
> > On Friday, 18 October 2019 15:21:05 UTC+2, Dima Pasechnik wrote:
> >>
> >> Hi,
> >> well, Sage's functionality for modules over
On Tuesday, 22 October 2019 23:23:44 UTC+2, Dima Pasechnik wrote:
>
> On Tue, Oct 22, 2019 at 9:51 PM 'Bill Hart' via sage-devel
> > wrote:
> >
> >
> >
> > On Friday, 18 October 2019 15:21:05 UTC+2, Dima Pasechnik wrote:
> >>
> >> Hi,
> >> well, Sage's functionality for modules over
On Tue, Oct 22, 2019 at 9:51 PM 'Bill Hart' via sage-devel
wrote:
>
>
>
> On Friday, 18 October 2019 15:21:05 UTC+2, Dima Pasechnik wrote:
>>
>> Hi,
>> well, Sage's functionality for modules over polynomial rings is quite
>> limited.
>> It assumes that a submodule of a free module is free.
>
>
>
>From the Singular documentation [1]:
"Hence any finitely generated [image: $R$]-module can be represented in S
INGULAR by its module of relations."
[1] https://www.singular.uni-kl.de/Manual/4-0-3/sing_134.htm
On Tuesday, 22 October 2019 22:51:45 UTC+2, Bill Hart wrote:
>
>
>
> On Friday, 18
On Friday, 18 October 2019 15:21:05 UTC+2, Dima Pasechnik wrote:
>
> Hi,
> well, Sage's functionality for modules over polynomial rings is quite
> limited.
> It assumes that a submodule of a free module is free.
>
In what way does it assume this? There are limitations, but I'm not so sure
On Friday, October 18, 2019 at 4:43:53 PM UTC+9, Mao Zeng wrote:
>
> As I understand, groebner_basis() in Sage uses Singular as a backend to
> compute the groebner basis of ideals in polynomial rings. However, Singular
> can also compute the groebner basis of modules. Is this functionality
>
Hi,
well, Sage's functionality for modules over polynomial rings is quite limited.
It assumes that a submodule of a free module is free.
We discussed this at length at a recent Sage/Macaulay2 coding sprint at IMA,
and concluded that it would be quite a bit of work to do.
While this is not
I've come up with a rather awkward workaround using the Sage interface to
libSingular. Still I'd be interested to learn about any simpler solution.
Below is the Singular code, followed by Sage code which performs the same
task.
Singular input:
ring R=73, (a,b), dp;
module module1 = [a,a^3],
