Seifert surfaces in open books, and a new coding algorithm for links

Rei Furihata; Mikami Hirasawa; Tsuyoshi Kobayashi

doi:10.1112/blms/bdn020

Home/Archive/arXiv

arXiv · math/0511152

Seifert surfaces in open books, and a new coding algorithm for links

Rei Furihata·Mikami Hirasawa·Tsuyoshi Kobayashi

View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a new standard form of a Seifert surface $F$. In that standard form, $F$ is obtained by successively plumbing flat annuli to a disk $D$, where the gluing regions are all in $D$. We show that any link has a Seifert surface in the standard form, and thereby present a new way of coding a link. We present an algorithm to read the code directly from a braid presentation.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Rei Furihata, Mikami Hirasawa, Tsuyoshi Kobayashi. 2005-11-07. Seifert surfaces in open books, and a new coding algorithm for links. https://doi.org/10.1112/blms%2Fbdn020

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

KEEP EXPLORING

Related papers

arXiv2026

The Burau representation of the braid group is faithful for n = 4

In this paper we use ideas introduced earlier by Moody, Long, Long-Paton, and Bigelow to prove the theorem of the title, that the Burau representation of the classical braid group is faithful for n = 4. An immediate corollary is that the Jones representation of the braid group is also faithful for n = 4.

math.GT↗

arXiv2026

A counterexample to the wrapping number conjecture

We exhibit an annular knot with wrapping number four whose Kauffman bracket has annular degree at most two. This disproves the wrapping number conjecture.

math.GT↗

arXiv2026

The Lorenz braid index and hyperbolic volume

A result of Futer, Kalfagianni, and Purcell implies that an upper volume bound for all link complements in the 3-sphere cannot depend solely on the braid index. In this paper, we introduce the Lorenz braid index and generalise the bunch algorithm to provide a general upper volume bound for all link complements in the 3-sphere. Such an upper bound is a quadratic polynomial in the Lorenz braid index. In addition, we construct an explicit family of hyperbolic Lorenz knots for which the classical braid index and the Seifert genus both tend to infinity, while the Lorenz braid index remains bounded.

math.GT↗