Search arXivSearch

arXiv · math/0408286

Tree Diagrams for String Links II: Determining Chord Diagrams

Abstract

In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term relations).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Blake Mellor. 2004-08-20. Tree Diagrams for String Links II: Determining Chord Diagrams. https://arxiv.org/abs/math/0408286

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

KEEP EXPLORING

Related papers

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

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