Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.21825

Ribbon concordances and slice obstructions: experiments and examples

Nathan M. Dunfield·Sherry Gong
View original source ↗Read source document ↗Export metadata ↓

Abstract

There are 352.2 million prime knots in the 3-sphere with at most 19 crossings. We study which of these knots are slice, in both the smooth and topological categories. While no algorithm is known for deciding whether a given knot is slice in either setting, we are able to determine it smoothly for all but about 11,400 knots (0.003% or 1 in 30,000) and topologically for all but about 1,400 knots (0.0004% or about 1 in 250,000). In particular, we show that some 1.6 million of these knots (0.46%) are smoothly slice (in fact ribbon) and that 350.5 million are not even topologically slice (99.54%). We use a wide range of tools and techniques, and introduce several new or refined methods for probing these properties. Along the way, we produce 500,000 pairs of 0-friends, that is, pairs of distinct knots with the same 0-surgery. We discuss how our data is consistent with several important conjectures and suggests new ones, and highlight the simplest knots where sliceness remains unknown.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan M. Dunfield, Sherry Gong. 2025-12-26. Ribbon concordances and slice obstructions: experiments and examples. https://arxiv.org/abs/2512.21825

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT↗
arXiv2026

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT↗
arXiv2026

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT↗