Back to search

Clemson University

Lyubeznik Ideals Minimally Generated by Four or Fewer Elements

Abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Mathematical and Statistical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Fontes, Nathan S
Contributors dc:contributor
  • Keri Sather-Wagstaff
  • Jim Coykendall
  • Michael Burr

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/3852

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Fontes, Nathan S. Lyubeznik Ideals Minimally Generated by Four or Fewer Elements. Thesis thesis, https://open.clemson.edu/all_theses/3852