English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

It is shown that the methods and algorithms, developed in (A. Capani et al.,Computing minimal finite free resolutions, {\it Journal of Pure and AppliedAlgebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\itComputational Commutative Algebra 2}, Springer, 2005.) for computing minimalhomogeneous generating sets of graded submodules and graded quotient modules offree modules over a commutative polynomial algebra, can be adapted forcomputing minimal homogeneous generating sets of graded submodules and gradedquotient modules of free modules over a weighted $\mathbb{N}$-graded solvablepolynomial algebra, where solvable polynomial algebras are in the sense of (A.Kandri-Rody and V. Weispfenning, Non-commutative Gr\"obner bases in algebras ofsolvable type. {\it J. Symbolic Comput.}, 9(1990), 1--26). Consequently,algorithmic procedures for computing minimal finite graded free resolutionsover weighted $\mathbb{N}$-graded solvable polynomial algebras are achieved.

Computation of Minimal Graded Free Resolutions over $\mathbb{N}$-Graded Solvable Polynomial Algebras