Intrinsic linking and knotting are arbitrarily complex
| dc.creator | Flapan, Erica | |
| dc.creator | Mellor, Blake | |
| dc.creator | Naimi, Ramin | |
| dc.date | 2006-10-16 | |
| dc.date | 2008-06-06 | |
| dc.date.accessioned | 2026-07-07T12:30:45Z | |
| dc.date.available | 2026-07-07T12:30:45Z | |
| dc.description | We show that, given any $n$ and $α$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geqα$ and $|a_2(Q_i)|\geqα$, where $a_{2}(Q_i)$ denotes the second coefficient of the Conway polynomial of $Q_i$. | |
| dc.description | 18 pages, 5 figures. Proposition 2 has been strengthened, and Corollary 1 and Proposition 3 have been added to answer a question of Taniyama's | |
| dc.identifier | https://arxiv.org/abs/math/0610501 | |
| dc.identifier | http://arxiv.org/abs/math/0610501 | |
| dc.identifier | Fund. Math., vol. 201, no. 2, 2008, pp. 131-148 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216231 | |
| dc.subject | Geometric Topology | |
| dc.subject | Combinatorics | |
| dc.subject | 57M25, 57M15, 05C10 | |
| dc.title | Intrinsic linking and knotting are arbitrarily complex | |
| dc.type | text |