Skip to content

On detection probabilities of link invariants

Sep 2025 · arXiv.org · Vol abs/2509.05574 · 3 citations · ⚡ 1 influential · 52 references
Computer Science Mathematics

Abstract

We prove that, for many standard link invariants, both the proportion of distinct invariant values and the detection probability among prime alternating links with at most n crossings decay exponentially in n, with an explicit universal rate. In fact, almost every such link belongs to an invariant fiber whose size is itself exponential in n. This phenomenon applies broadly, in particular to the Jones and HOMFLYPT polynomials and integral Khovanov homology. The companion website gives a much more detailed view of the data, including complete distributions of fiber sizes, separate alternating and non-alternating data, and topological data analysis.

View source

Similar papers

Preprint Aug 2026

Linking invariants of spatial graphs

We recall definitions of linking numbers and Wu--Simon numbers for spatial graphs. We expose a `converse'to the Conway--Gordon--Sachs theorem (i.e. description of linking functions for embeddings $K_6\to\mathbb{R}^3$), and some results on Wu--Simon numbers. We conjecture and discuss a generalization of the Conway--Gord...

E. Alkin, Yu. Khromin, A. Skopenkov · 0 citations
Preprint Jul 2026

Genus-zero links with prescribed knots as components

We prove that any finite collection of at least three isotopy classes of knots in a 3-manifold $M$ is realizable as the components of a genus-zero link in $M$, provided that an obvious requirement on their conjugacy classes in $\pi_1(M)$ is met. This condition is vacuously satisfied for $M = \mathbb S^3$, and in this c...

Raphael Appenzeller, José Pedro Quintanilha · 1 citation
Preprint Jul 2026

Random linear configurations in dense sets and primes

We prove that every polylogarithmically dense subset of $[N]$ contains a nontrivial configuration $x+b_1m,\ldots,x+b_km$ for almost all choices of the coefficient vector $(b_1,\ldots, b_k)$ in a wide range of scales. We prove the same statement for polylogarithmically relatively dense subsets of the primes, in a shorte...

Lasse Grimmelt, Joni Teräväinen · 0 citations
Preprint Aug 2026

Uniform exponent bounds for integral group homology

We prove that, in each fixed degree, the exponent of the integral homology of a finite group is bounded solely in terms of the degree and the exponent of the group. The proof combines the solution of the restricted Burnside problem with a representability property of the bar construction and may be viewed as a torsion...

P. Moravec · 0 citations
Preprint Aug 2026

An Alexander Polynomial Refinement for Alternating Links, with Trapezoidal Properties

We define an invariant of alternating links---a homogeneous, four-variable Laurent polynomial---that encodes the symmetrized Alexander polynomial, the signature, and other topological data. Along the way, we extend a spanning tree formulation of the Alexander polynomial due to Murasugi and Stoimenow from special altern...

Joe Boninger · 0 citations
Preprint Jul 2026

Local statistics and average rank of genus $g$ hyperelliptic curves with a Weierstrass point

In this paper, we determine the probability that a genus $g$ hyperelliptic curve with a Weierstrass point over a number field has good reduction at a given prime of residue characteristic $>2g+1$. We also obtain analogous probability formulas for several other reduction types, including cases with positive toric or uni...

Keunyoung Jeong, Junyeong Park · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.