The influence of collision angle for viscous vortex reconnection
Bibliographic record
Abstract
We revisit the mechanism of viscous vortex reconnection by considering the collision of vortex rings over a range of initial collision angles and Reynolds numbers. While the overall reconnection process is similar to anti-parallel vortex reconnection, we find that collision angle exerts significant influence over the process, altering the evolution of various global and local quantities. The collision angle primarily manipulates the “pyramid” process, a recently identified stretching mechanism proposed by Moffatt and Kimura [“Towards a finite-time singularity of the Navier-Stokes equations Part 1. Derivation and analysis of dynamical system,” J. Fluid Mech., 861, 930–967 (2019)] to be a potential pathway for finite-time singularity of Euler’s equations, during the approach stage of the rings. However, the “pyramid” process is short-lived for viscous vortices. The present work shows that the “pyramid” process is arrested by parallelization of the colliding vortices, wherein contact of the colliding vortices halts their motion toward each other at the pyramid apex, allowing the rest of the vortex tube to “catch up,” breaking the pyramid structure. Parallelization marks the transition to a second phase of stretching, where the colliding vortices remain parallel. Vorticity amplification from pyramid stretching is significantly stronger than for its parallel counterpart, and is thus the dominant factor determining reconnection properties. Based upon the findings in this study, we conjecture that the parallelization process is the primary mechanism that prevents the finite-time singularity through the pyramid process. Critically, the Reynolds number scaling for the reconnection rate differs depending on the collision angle, which challenges the conjecture of universal Reynolds number scaling in the literature.
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.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".