Every weakly negative definite plumbing tree can be reduced to a negative definite one by a finite sequence of Neumann moves, with an explicit algorithm combining plumbing calculus and a diagonalization procedure.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Plumbed 3-Manifolds and Neumann Moves
Every weakly negative definite plumbing tree can be reduced to a negative definite one by a finite sequence of Neumann moves, with an explicit algorithm combining plumbing calculus and a diagonalization procedure.