Topologically protected vortex knots and links
Bibliographic record
Abstract
Abstract In 1869, Lord Kelvin found that the way vortices are knotted and linked in an ideal fluid remains unchanged in evolution, and consequently hypothesized atoms to be knotted vortices in a ubiquitous ether, different knotting types corresponding to different types of atoms. Even though Kelvin’s atomic theory turned out incorrect, it inspired several important developments, such as the mathematical theory of knots and the investigation of knotted structures that naturally arise in physics. However, in previous studies, knotted and linked structures have been found to untie via local cut-and-paste events referred to as reconnections. Here, in contrast, we construct knots and links of non-Abelian vortices that are topologically protected in the sense that they cannot be dissolved employing local reconnections and strand crossings. Importantly, the topologically protected links are supported by a variety of physical systems such as dilute Bose-Einstein condensates and liquid crystals. We also propose a classification scheme for topological vortex links, in which two structures are considered equivalent if they differ from each other by a sequence of topologically allowed reconnections and strand crossings, in addition to the typical continuous transformations. Interestingly, this scheme produces a remarkably simple classification.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".