Papers
Topics
Authors
Recent
Search
2000 character limit reached

Macaulay bases of modules

Published 8 Aug 2021 in math.AC, cs.SC, and math.RA | (2108.03707v1)

Abstract: We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay $H$-bases to suitably graded modules over a commutative graded $\mathbf{k}$-algebra, where the index sets of the two gradings may differ. This includes Groebner bases of modules as a special case, in contrast to previous work on Macaulay bases of modules. We show that the standard results on Groebner bases and Macaulay $H$-bases generalize in fields of arbitrary characteristic to Macaulay bases, including the reduction algorithm and Buchberger's criterion and algorithm. A key result is that Macaulay bases, in contrast to Groebner bases, respect symmetries when there is a group $G$ acting homogeneously on a graded module, in which case the reduction algorithm is $G$-equivariant and the $\mathbf{k}$-span of a Macaulay basis is $G$-invariant. We also show that some of the standard applications of Groebner bases can be generalized to Macaulay bases, including elimination and computation of syzygy modules, which require the generalization to modules that was not present in previous work.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.