Log-Canonical Rings of Graph Curves Público

Abstract

I generalize David Zureick-Brown and John Voight's work on log-canonical rings to graph curves. I use a paper of Noot as a starting point. I outline some of the difficulties in developing Max Noether-like and Petri-like theorems. I work out theorems for the generators of most well behaved graph curves. I also find a useful construction for hyperelliptic graph curves.

Table of Contents

Introduction - 1

Noneffective canoincal divisors and bridges - 2

Inductive Step - 3

One point log divisors - 3

Two point log divisors - 4

Three point log divisors - 5

Hyper Elliptic Curves - 5

About this Master's Thesis

Rights statement

• Permission granted by the author to include this thesis or dissertation in this repository. All rights reserved by the author. Please contact the author for information regarding the reproduction and use of this thesis or dissertation.

School	Laney Graduate School
Department	Math and Computer Science
Degree	MS
Submission	Master's Thesis
Language	English
Research Field	Mathematics
Palabra Clave	Canonical Ring Graph Curve Stable Curve
Committee Chair / Thesis Advisor	Zureick-Brown, David M, Emory University
Committee Members	Raman, Parimala, Emory University Allison, Blake A, Emory University

Última modificación

Primary PDF

Thumbnail	Title	Date Uploaded	Actions
	Log-Canonical Rings of Graph Curves ()	2018-08-28 12:07:14 -0400	Press to Select an action Download

Supplemental Files

Thumbnail	Title	Date Uploaded	Actions