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

Benjamin Bode; Mark Dennis

doi:10.1142/S0218216518500827

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

Benjamin Bode
, Mark Dennis

Research output: Contribution to journal › Article (Academic Journal) › peer-review

22 Citations (Scopus)

245 Downloads (Pure)

Abstract

We describe an algorithm that for every given braid B explicitly constructs a function f:C2→C such that f is a polynomial in u, v and v¯¯¯ 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.

Original language	English
Article number	1850082
Number of pages	31
Journal	Journal of Knot Theory and its Ramifications
Volume	28
Issue number	1
Early online date	10 Jan 2019
DOIs	https://doi.org/10.1142/S0218216518500827
Publication status	Published - Jan 2019

Research Groups and Themes

SPOCK

Keywords

applied topology
real algebraic knot theory
braids
Morse-Novikov number
knotted fields
constructive approach to knot theory

Access to Document

10.1142/S0218216518500827

Full-text PDF (accepted author manuscript)
This is the author accepted manuscript (AAM). The final published version (version of record) is available online via World Scientific at https://www.worldscientific.com/doi/abs/10.1142/S0218216518500827 . Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 561 KB

Handle.net

Persistent link

Cite this

@article{0aa2845b56c741a9913149f1cb58abe1,

title = "Constructing a polynomial whose nodal set is any prescribed knot or link",

abstract = "We describe an algorithm that for every given braid B explicitly constructs a function f:C2→C such that f is a polynomial in u, v and v¯¯¯ 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.",

keywords = "applied topology, real algebraic knot theory, braids, Morse-Novikov number, knotted fields, constructive approach to knot theory",

author = "Benjamin Bode and Mark Dennis",

year = "2019",

month = jan,

doi = "10.1142/S0218216518500827",

language = "English",

volume = "28",

journal = "Journal of Knot Theory and its Ramifications",

issn = "0218-2165",

publisher = "World Scientific",

number = "1",

}

TY - JOUR

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

AU - Bode, Benjamin

AU - Dennis, Mark

PY - 2019/1

Y1 - 2019/1

N2 - We describe an algorithm that for every given braid B explicitly constructs a function f:C2→C such that f is a polynomial in u, v and v¯¯¯ 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.

AB - We describe an algorithm that for every given braid B explicitly constructs a function f:C2→C such that f is a polynomial in u, v and v¯¯¯ 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.

KW - applied topology

KW - real algebraic knot theory

KW - braids

KW - Morse-Novikov number

KW - knotted fields

KW - constructive approach to knot theory

UR - https://arxiv.org/abs/1612.06328

UR - https://www.scopus.com/pages/publications/85060055358

U2 - 10.1142/S0218216518500827

DO - 10.1142/S0218216518500827

M3 - Article (Academic Journal)

SN - 0218-2165

VL - 28

JO - Journal of Knot Theory and its Ramifications

JF - Journal of Knot Theory and its Ramifications

IS - 1

M1 - 1850082

ER -

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

Abstract

Research Groups and Themes

Keywords

Access to Document

Handle.net

Other files and links

Embargoed Document

Fingerprint

Cite this