Abstract
dc:description.abstractWe give a constructive proof that every weakly negative definite plumbing tree can be transformed into a negative definite one by a finite sequence of Neumann moves. The argument combines Neumann’s plumbing calculus with the diagonalization algorithm of Duchon, Eisenbud, and Neumann, which extracts the eigenvalues of the framing matrix directly from the combinatorics of the tree. We show that any positive eigenvalues are supported on linear branches and can be eliminated systematically via controlled applications of Neumann moves. This provides an explicit algorithm reducing weakly negative definite plumbing trees to negative definite ones.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Pope, Noah J
- Contributors dc:contributor
-
- Nicola Tarasca
Subjects
dc:subject × 7Rights
dc:rights- Statement dc:rights
-
- © The Author
Identifiers
dc:identifier.*- Identifier
- https://scholarscompass.vcu.edu/etd/8334