{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/139576"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/139576","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Macaulay Bases of Modules","abstract":"We introduce fully general Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay 𝐻-bases to suitably graded modules over a commutative graded k-algebra, where the index sets of the two gradings may differ. The additional generality 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 𝐻-bases generalize in fields of arbitrary characteristic to Macaulay bases, including the reduction algorithm and Buchberger’s criterion and algorithm framework. A key result is that Macaulay bases, in contrast to Groebner bases, respect symmetries when there is a group 𝐺 acting homogeneously on a graded module, in which case the reduction algorithm is 𝐺-equivariant and the k-span of a Macaulay basis is 𝐺-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.","abstract_html":"We introduce fully general Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay 𝐻-bases to suitably graded modules over a commutative graded k-algebra, where the index sets of the two gradings may differ. The additional generality 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 𝐻-bases generalize in fields of arbitrary characteristic to Macaulay bases, including the reduction algorithm and Buchberger’s criterion and algorithm framework. A key result is that Macaulay bases, in contrast to Groebner bases, respect symmetries when there is a group 𝐺 acting homogeneously on a graded module, in which case the reduction algorithm is 𝐺-equivariant and the k-span of a Macaulay basis is 𝐺-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.","abstract_has_math":false,"creators":["Rao, Sujit"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Parrilo, Pablo A."],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-06","date_published":"2021-06","updated_at":"2026-07-22T22:21:16Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/139576","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Parrilo, Pablo A."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Rao, Sujit"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-01-14T15:20:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-01-14T15:20:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-06"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Science in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/139576"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We introduce fully general Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay 𝐻-bases to suitably graded modules over a commutative graded k-algebra, where the index sets of the two gradings may differ. The additional generality 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 𝐻-bases generalize in fields of arbitrary characteristic to Macaulay bases, including the reduction algorithm and Buchberger’s criterion and algorithm framework. A key result is that Macaulay bases, in contrast to Groebner bases, respect symmetries when there is a group 𝐺 acting homogeneously on a graded module, in which case the reduction algorithm is 𝐺-equivariant and the k-span of a Macaulay basis is 𝐺-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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["Macaulay Bases of Modules"]}]}],"canonical_facts":{"dc:contributor.advisor":["Parrilo, Pablo A."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Rao, Sujit"],"dc:date.accessioned":["2022-01-14T15:20:59Z"],"dc:date.available":["2022-01-14T15:20:59Z"],"dc:date.issued":["2021-06"],"dc:description.abstract":["We introduce fully general Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay 𝐻-bases to suitably graded modules over a commutative graded k-algebra, where the index sets of the two gradings may differ. The additional generality 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 𝐻-bases generalize in fields of arbitrary characteristic to Macaulay bases, including the reduction algorithm and Buchberger’s criterion and algorithm framework. A key result is that Macaulay bases, in contrast to Groebner bases, respect symmetries when there is a group 𝐺 acting homogeneously on a graded module, in which case the reduction algorithm is 𝐺-equivariant and the k-span of a Macaulay basis is 𝐺-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."],"dc:description.degree":["S.M."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/139576"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Macaulay Bases of Modules"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Science in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:21:16Z"}