Constructing a polynomial whose nodal set is any prescribed knot or link

From MaRDI portal
Publication:4623280

DOI10.1142/S0218216518500827zbMATH Open1411.57010arXiv1612.06328WikidataQ128895370 ScholiaQ128895370MaRDI QIDQ4623280FDOQ4623280


Authors: Benjamin Bode, M. R. Dennis Edit this on Wikidata


Publication date: 14 February 2019

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: We describe an algorithm that for every given braid B explicitly constructs a function f:mathbbC2ightarrowmathbbC such that f is a polynomial in u, v and overlinev and the zero level set of f on the unit three-sphere is the closure of B. The nature of this construction allows us to prove certain properties of the constructed polynomials. In particular, we provide bounds on the degree of f in terms of braid data.


Full work available at URL: https://arxiv.org/abs/1612.06328




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Constructing a polynomial whose nodal set is any prescribed knot or link

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623280)