Resolutions of Monomial Ideals Via Quasi-Trees
dc.contributor.author | Hersey, Benjamin | |
dc.contributor.copyright-release | Not Applicable | en_US |
dc.contributor.degree | Master of Science | en_US |
dc.contributor.department | Department of Mathematics & Statistics - Math Division | en_US |
dc.contributor.ethics-approval | Not Applicable | en_US |
dc.contributor.external-examiner | n/a | en_US |
dc.contributor.graduate-coordinator | David Iron | en_US |
dc.contributor.manuscripts | Not Applicable | en_US |
dc.contributor.thesis-reader | Jason Brown | en_US |
dc.contributor.thesis-reader | Richard Nowakowski | en_US |
dc.contributor.thesis-supervisor | Sara Faridi | en_US |
dc.date.accessioned | 2015-08-21T17:08:03Z | |
dc.date.available | 2015-08-21T17:08:03Z | |
dc.date.defence | 2015-08-18 | |
dc.date.issued | 2015 | |
dc.description.abstract | We examine ways in which simplicial complexes can be used for describing, classifying, and studying multigraded free resolutions of monomial ideals. By using homgenizations of frames and dehomogenizations of resolutions we can, under appropriate circumstances, describe the structure of a resolution of a monomial ideal by a simiplicial complex. We discuss the successes and failures of this approach. We finish by applying the tools we have presented to quasi-trees, providing a new proof to a theorem of Herzog, Hibi, and Zheng which classifies monomial ideals with minimal projective dimension. | en_US |
dc.identifier.uri | http://hdl.handle.net/10222/60768 | |
dc.language.iso | en | en_US |
dc.subject | resolution | en_US |
dc.subject | Quasi-tree | en_US |
dc.subject | Monomial Ideal | en_US |
dc.title | Resolutions of Monomial Ideals Via Quasi-Trees | en_US |
dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Hersey-Benjamin-MSc-MATH-August-2015.pdf
- Size:
- 970.08 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: