{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-4880"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-4880","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Lyubeznik Ideals Minimally Generated by Four or Fewer Elements","abstract":"Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik by using covers of generators of I, a construction due to Guo, Wu, and Yu [3] that is distinct from its Lyubeznik resolution. For monomial ideals of a polynomial ring, we characterize all Lyubeznik ideals that are minimally generated by four or fewer generators, and provide the total order that produces the minimal Lyubeznik resolution for all such ideals.","abstract_html":"Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik by using covers of generators of I, a construction due to Guo, Wu, and Yu [3] that is distinct from its Lyubeznik resolution. For monomial ideals of a polynomial ring, we characterize all Lyubeznik ideals that are minimally generated by four or fewer generators, and provide the total order that produces the minimal Lyubeznik resolution for all such ideals.","abstract_has_math":false,"creators":["Fontes, Nathan S"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"School of Mathematical and Statistical Sciences","degree_department":null,"school":null,"contributors":["Keri Sather-Wagstaff","Jim Coykendall","Michael Burr"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:29:42Z","subjects":["Lyubeznik ideal","minimal cover","minimal free resolution","Algebra"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/3852","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/3852","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-4880","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Keri Sather-Wagstaff","Jim Coykendall","Michael Burr"]},{"key":"dc:creator","label":"Author","values":["Fontes, Nathan S"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2022-07-23T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2022-08-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["School of Mathematical and Statistical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Lyubeznik ideal","minimal cover","minimal free resolution","Algebra"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/3852"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik by using covers of generators of I, a construction due to Guo, Wu, and Yu [3] that is distinct from its Lyubeznik resolution. For monomial ideals of a polynomial ring, we characterize all Lyubeznik ideals that are minimally generated by four or fewer generators, and provide the total order that produces the minimal Lyubeznik resolution for all such ideals."]},{"key":"dc:title","label":"Title","values":["Lyubeznik Ideals Minimally Generated by Four or Fewer Elements"]}]}],"canonical_facts":{"dc:contributor":["Keri Sather-Wagstaff","Jim Coykendall","Michael Burr"],"dc:creator":["Fontes, Nathan S"],"dc:date.available":["2022-07-23T07:00:00Z"],"dc:date.created":["2022-08-01T07:00:00Z"],"dc:description.abstract":["Free resolutions for an ideal are constructions that tell us useful information about the structure of the ideal. Every ideal has one minimal free resolution which tells us significantly more about the structure of the ideal. In this thesis, we consider a specific type of resolution, the Lyubeznik resolution, for a monomial ideal I, which is constructed using a total order on the minimal generating set G(I). An ideal is called Lyubeznik if some total order on G(I) produces a minimal Lyubeznik resolution for I. We investigate the problem of characterizing whether an ideal I is Lyubeznik by using covers of generators of I, a construction due to Guo, Wu, and Yu [3] that is distinct from its Lyubeznik resolution. For monomial ideals of a polynomial ring, we characterize all Lyubeznik ideals that are minimally generated by four or fewer generators, and provide the total order that produces the minimal Lyubeznik resolution for all such ideals."],"dc:identifier":["https://open.clemson.edu/all_theses/3852"],"dc:subject":["Lyubeznik ideal","minimal cover","minimal free resolution","Algebra"],"dc:title":["Lyubeznik Ideals Minimally Generated by Four or Fewer Elements"],"thesis:degree_discipline":["School of Mathematical and Statistical Sciences"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:29:42Z"}