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

From MaRDI portal
Publication:4623280




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.









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)