On Tue, Oct 22, 2019 at 9:51 PM 'Bill Hart' via sage-devel <sage-devel@googlegroups.com> 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. > > > In what way does it assume this? There are limitations, but I'm not so sure I > would summarise them like this.
I am talking about Sage, not Singular. Singular's functionality to work with modules over polynomial rings is not exposed in Sage at all. In Sage every (sub)module comes with a basis. This works only for modules over PIDs, if I recall correctly. > >> 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. > > > There is a major effort planned/underway to implement more sophisticated > modules (in fact as I understand it, J. Boehm already has a prototype/first > implementation in Singular itself, conducted under his supervision by a > student). > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-devel+unsubscr...@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-devel/9fc49cba-a627-4f50-849f-a93dd37102c4%40googlegroups.com. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAAWYfq0NGqqna3Za9ezOdwn6BjQVZh6wHyV%3DMXcJzevQbkonbg%40mail.gmail.com.
