Abstract
dc:description.abstractWe investigate how the coefficients of a sparse polynomial system influence the sum, or the trace, of its solutions. We discuss an extension of the classical trace test in numerical algebraic geometry to sparse polynomial systems. Two known methods for identifying a trace affine linear subset of the support of a sparse polynomial system use sparse resultants and polyhedral geometry, respectively. We introduce a new approach which provides more precise classifications of trace affine linear sets than was previously known. For this new approach, we developed software in Macaulay2.
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
-
- McKay, Julianne
- Contributors dc:contributor
-
- Michael Burr
- Ryann Cartor
- Shuhong Gao
- Svetlana Poznanović
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_theses/3831