The use of graphs in algebraic studies is ubiquitous, whether the graphs be finite or infinite, directed or undirected. Green and Zacharia have characterized finite generation of the cohomology rings of monomial algebras, and thereafter G. Davis determined a finite criteria for such generation in the case of cycle algebras. Herein, we describe the construction of a finite directed graph upon which criteria can be established to determine finite generation of the cohomology ring of in-spoked cycle" algebras, a class of algebras that includes cycle algebras. We then show the further usefulness of this constructed graph by studying other monomial algebras, including d-Koszul monomial algebras and a new class of monomial algebras which we term "left/right-symmetric" algebras. / Ph. D.
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/29865 |
| Date | 09 December 2010 |
| Creators | Cone, Randall Edward |
| Contributors | Mathematics, Green, Edward L., Loehr, Nicholas A., Linnell, Peter A., Brown, Ezra A., Day, Martin V. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Dissertation |
| Format | application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | Cone_RE_D_2010.pdf |
Page generated in 0.0061 seconds