Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.04915

Alexander polynomials of simple-ribbon knots

Kengo Kishimoto·Tetsuo Shibuya·Tatsuya Tsukamoto·Tsuneo Ishikawa
View original source ↗Read source document ↗Export metadata ↓

Abstract

In a previous paper, we introduced special types of fusions, so called simple-ribbon fusions on links. A knot obtained from the trivial knot by a finite sequence of simple-ribbon fusions is called a simple-ribbon knot. Every ribbon knot with <10 crossings is a simple-ribbon knot. In this paper, we give a formula for the Alexander polynomials of simple-ribbon knots. Using the formula, we determine if a knot with 10 crossings is a simple-ribbon knot. Every simple-ribbon fusion can be realized by ``elementary" simple-ribbon fusions. We call a knot a p-simple-ribbon knot if the knot is obtained from the trivial knot by a finite sequence of elementary p-simple-ribbon fusions for a fixed positive integer p. We provide a condition for a simple-ribbon knot to be both of an m-simple-ribbon knot and an n-simple-ribbon knot for positive integers m and n.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kengo Kishimoto, Tetsuo Shibuya, Tatsuya Tsukamoto, Tsuneo Ishikawa. 2023-12-29. Alexander polynomials of simple-ribbon knots. https://arxiv.org/abs/1905.04915

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↗