[Wishlist from Aachen] trinity command

[levandov]

Applies: the whole Singular
In a number of applications one needs to call a command like 'trinity' (for Groebner trinity), which, given a module M, returns a list with three entries
(1) Groebner resp. standard basis of a module M
(2) first syzygy module (not in Groebner basis form) of M
(3) transformation matrix (lift) between M and the 1st entry.

Question: is there a generically best recipe for computing these objects in a shorter time? Quite often a pair STD and SYZ is needed, and it is strange when one has to compute SYZ already having computed STD in the precious step. I talk here about big problems in the first place.

It would be very nice to have a second argument, which will allow one to select the variant of Groebner basis algorithm, which will be used (std, stdhilb, slimgb, ...)

[hannes]

integrated into liftstd.