Intrinsic linking and knotting are arbitrarily complex

• Autorzy: Erica Flapan , Blake Mellor , Ramin Naimi
• Języki publikacji: EN

Abstrakty

EN

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

Kategorie tematyczne

• 57M25: Knots and links in S 3
• 05C10: Planar graphs; geometric and topological aspects of graph theory
• 57M15: Relations with graph theory

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Fundamenta Mathematicae
• Rocznik: 2008
• Tom: 201
• Numer: 2
• Strony: 131-148

Daty

wydano

2008

Twórcy

autor

Erica Flapan

• Department of Mathematics, Pomona College, Claremont, CA 91711, U.S.A.

autor

Blake Mellor

• Department of Mathematics, Loyola Marymount University, Los Angeles, CA 90045, U.S.A.

autor

Ramin Naimi

• Department of Mathematics, Occidental College, Los Angeles, CA 90041, U.S.A.

Identyfikatory

DOI

10.4064/fm201-2-3