Intrinsic linking and knotting are arbitrarily complex

Authors

Erica Flapan
Blake Mellor, Loyola Marymount UniversityFollow
Ramin Naimi

Document Type

Article - post-print

Publication Date

2008

Abstract

We show that, given any n and α, every embedding of any sufficiently large complete graph in R³ contains an oriented link with components Q₁, ..., Q_n such that for every i≠j, $|\lk(Q_i,Q_j)|\geq\alpha$ and |a₂(Qi)|≥α, where a₂(Q_i) denotes the second coefficient of the Conway polynomial of Q_i.

Comments

This is a post-print version of the article.

Original Publication Citation

Flapan, E., B. Mellor, and R. Naimi, 2008: Intrinsic linking and knotting are arbitrarily complex. Fundamenta Mathematicae, 201.2, 131-148, arXiv:math/0610501.

Digital Commons @ LMU & LLS Citation

Flapan, Erica; Mellor, Blake; and Naimi, Ramin, "Intrinsic linking and knotting are arbitrarily complex" (2008). Mathematics, Statistics and Data Science Faculty Works. 34.
https://digitalcommons.lmu.edu/math_fac/34