2021 Volume 73 Issue 4 Pages 1289-1322
We present an algorithm that takes as input any element 𝐵 of the loop braid group and constructs a polynomial 𝑓 : ℝ5 → ℝ2 such that the intersection of the vanishing set of 𝑓 and the unit 4-sphere contains the closure of 𝐵. The polynomials can be used to create real analytic time-dependent vector fields with zero divergence and closed flow lines that move as prescribed by 𝐵. We also show how a family of surface braids in ℂ ×𝑆1 ×𝑆1 without branch points can be constructed as the vanishing set of a holomorphic polynomial 𝑓 : ℂ3 → ℂ on ℂ ×𝑆1 ×𝑆1 ⊂ ℂ3. Both constructions allow us to give upper bounds on the degree of the polynomials.
This article cannot obtain the latest cited-by information.