4 citations · 12 across the 13 of their papers we have counts for
4 papers · 1 filter
A constructive approach to Freyd categories
Sebastian Posur
In this paper we give an algorithmic description of Freyd categories that subsumes and enhances the usual approach to finitely presented modules in computer algebra. The upshot is…
Constructing equivariant vector bundles via the BGG correspondence
Sebastian Posur
We describe a strategy for the construction of finitely generated -equivariant -graded modules over the exterior algebra for a finite group . By an equivarian…
Linear systems over localizations of rings
Sebastian Posur
We describe a method for solving linear systems over the localization of a commutative ring at a multiplicatively closed subset that works under the following hypotheses: t…
Elimination via saturation
Mohamed Barakat, Markus Lange-Hegermann, Sebastian Posur
This short paper presents saturation-based algorithms for homogenization and elimination. This algorithm can compute elimination ideals by using syzygies and ideal membership test,…