Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 30 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 116 tok/s Pro
Kimi K2 191 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Knotted surfaces as vanishing sets of polynomials (2004.02468v2)

Published 6 Apr 2020 in math.GT

Abstract: We present an algorithm that takes as input any element $B$ of the loop braid group and constructs a polynomial $f:\mathbb{R}5\to\mathbb{R}2$ such that the intersection of the vanishing set of $f$ and the unit 4-sphere contains the closure of $B$. 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 $B$. We also show how a family of surface braids in $\mathbb{C}\times S1\times S1$ without branch points can be constructed as the vanishing set of a holomorphic polynomial $f:\mathbb{C}3\to\mathbb{C}$ on $\mathbb{C}\times S1\times S1\subset\mathbb{C}3$. Both constructions allow us to give upper bounds on the degree of the polynomials.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube