惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

N
Netflix TechBlog - Medium
月光博客
月光博客
Y
Y Combinator Blog
WordPress大学
WordPress大学
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
雷峰网
雷峰网
美团技术团队
T
Tailwind CSS Blog
小众软件
小众软件
量子位
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
有赞技术团队
有赞技术团队
P
Proofpoint News Feed
G
Google Developers Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Recent Announcements
Recent Announcements
The GitHub Blog
The GitHub Blog
博客园 - 三生石上(FineUI控件)
云风的 BLOG
云风的 BLOG
Vercel News
Vercel News
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
爱范儿
爱范儿
V
Visual Studio Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Dihedral Linking Invariants
[Submitted on 29 Dec 2021 (v1), last revised 25 Jun 2026 (this v · 2026-06-26 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:A Fox p-colored knot $K$ in $S^3$ gives rise to a corresponding $p$-fold dihedral branched cover $M$ of $S^3$ along $K$. The pre-image of the knot $K$ under the covering map is a $\dfrac{p+1}{2}$-component link $L$ in $M$, and the set of pairwise linking numbers of the components of $L$ is an invariant of $K$. This powerful invariant played a key role in the development of early knot tables, and appears in formulas for many other important knot and manifold invariants. We give an algorithm for computing this invariant for all odd $p$, generalizing an algorithm of Perko. We then extend this algorithm to compute linking numbers of arbitrary curves in a $p$-fold dihedral branched cover of $S^3$ along $K$. As an application, we compute Kjuchukova's ribbon obstruction $\Xi_p$ using a method of the first author and Kjuchukova. We also tabulate the dihedral linking invariant for all $p$-colorings of prime knots of crossing number less than or equal to 13, with $p\geq 3$ prime. Finally, we demonstrate the strength of the dihedral linking invariant by comparing it to several polynomial invariants. For example, the dihedral linking invariant distinguishes more than 98% of the 1183 prime non-mutant knot pairs with the same Fox coloring invariant and the same HOMFLY-PT polynomial through 13 crossings.

Submission history

From: Patricia Cahn [view email]
[v1] Wed, 29 Dec 2021 19:03:12 UTC (3,608 KB)
[v2] Thu, 25 Jun 2026 15:31:45 UTC (4,653 KB)