University of North Texas
Counting Plane Tropical Curves via Lattice Paths in Polygons
Abstract
dc:descriptionA projective plane tropical curve is a proper immersion of a graph into the real Cartesian plane subject to some conditions such as that the images of all the edges must be lines with rational slopes. Two important combinatorial invariants of a projective plane tropical curve are its degree, d, and genus g. First, we explore Gathmann and Markwig's approach to the study of the moduli spaces of such curves and explain their proof that the number of projective plane tropical curves, counting multiplicity, passing through n = 3d + g -1 points does not depend on the choice of points, provided they are in tropical general position. This number of curves is called a Gromov-Written invariant. Second, we discuss the proof of a theorem of Mikhalkin that allows one to compute the Gromov-Written invariant by a purely combinatorial process of counting certain lattice paths.
Degree
thesis:*- Grantor dc:publisher
- University of North Texas
- Year dc:date
- 2021
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Zhang, Yingyu
- Contributors dc:contributor
-
- Cherry, William
- Brozovic, Douglas
Subjects
dc:subject × 4Rights
dc:rights- Statement dc:rights
-
- Public
- Zhang, Yingyu
- Copyright
- Copyright is held by the author, unless otherwise noted. All rights Reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
local-cont-no: submission_2754
https://digital.library.unt.edu/ark:/67531/metadc1873866/
ark: ark:/67531/metadc1873866